Efficient Algorithms for the Tree Homeomorphism Problem

Michaela Götz, Christoph Koch, Wim Martens. Efficient Algorithms for the Tree Homeomorphism Problem. In Marcelo Arenas, Michael I. Schwartzbach, editors, Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers. Volume 4797 of Lecture Notes in Computer Science, pages 17-31, Springer, 2007. [doi]

@inproceedings{GotzKM07,
  title = {Efficient Algorithms for the Tree Homeomorphism Problem},
  author = {Michaela Götz and Christoph Koch and Wim Martens},
  year = {2007},
  doi = {10.1007/978-3-540-75987-4_2},
  url = {http://dx.doi.org/10.1007/978-3-540-75987-4_2},
  researchr = {https://researchr.org/publication/GotzKM07},
  cites = {0},
  citedby = {0},
  pages = {17-31},
  booktitle = {Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers},
  editor = {Marcelo Arenas and Michael I. Schwartzbach},
  volume = {4797},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-75986-7},
}