Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs

Rui Ferreira, Roberto Grossi, Romeo Rizzi. Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. In Camil Demetrescu, Magnús M. Halldórsson, editors, Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Volume 6942 of Lecture Notes in Computer Science, pages 275-286, Springer, 2011. [doi]

@inproceedings{FerreiraGR11,
  title = {Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs},
  author = {Rui Ferreira and Roberto Grossi and Romeo Rizzi},
  year = {2011},
  doi = {10.1007/978-3-642-23719-5_24},
  url = {http://dx.doi.org/10.1007/978-3-642-23719-5_24},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FerreiraGR11},
  cites = {0},
  citedby = {0},
  pages = {275-286},
  booktitle = {Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings},
  editor = {Camil Demetrescu and Magnús M. Halldórsson},
  volume = {6942},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-23718-8},
}