Efficient bubble enumeration in directed graphs. Birmelé, E, Crescenzi, P., & Ferreira, R. In Caldeŕon-Benavides, L., Gonźalez-Caro, C., Ch́avez, E., & Ziviani, N., editors, SPIRE 2012: the 19th International Symposium String Processing and Information Retrieval, volume 7608, of Lecture Notes in Computer Science, pages 118--129, Cartagena de Indias, Colombia, October, 2012. Springer Berlin Heidelberg.
Efficient bubble enumeration in directed graphs [link]Paper  doi  bibtex   
@inproceedings{ Birmele2012,
  address = {Cartagena de Indias, Colombia},
  author = {Birmelé, E and Crescenzi, Pierluigi and Ferreira, Rui},
  booktitle = {SPIRE 2012: the 19th International Symposium String Processing and Information Retrieval},
  doi = {10.1007/978-3-642-34109-0_13},
  editor = {Caldeŕ{o}n-Benavides, Liliana and Gonź{a}lez-Caro, Cristina and Ch́{a}vez, Edgar and Ziviani, Nivio},
  file = {:Users/KunihiroWASA/Dropbox/paper/2012/Birmelé, Crescenzi, Ferreira, Efficient bubble enumeration in directed graphs, 2012.pdf:pdf},
  month = {October},
  pages = {118--129},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{Efficient bubble enumeration in directed graphs}},
  url = {http://link.springer.com/chapter/10.1007/978-3-642-34109-0_13},
  volume = {7608},
  year = {2012}
}

Downloads: 0