Andre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel. Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. In Hee-Kap Ahn, Chan-Su Shin, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Volume 8889 of Lecture Notes in Computer Science, pages 81-93, Springer, 2014. [doi]
@inproceedings{DroschinskyHKM14,
title = {Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay},
author = {Andre Droschinsky and Bernhard Heinemann and Nils Kriege and Petra Mutzel},
year = {2014},
doi = {10.1007/978-3-319-13075-0_7},
url = {http://dx.doi.org/10.1007/978-3-319-13075-0_7},
researchr = {https://researchr.org/publication/DroschinskyHKM14},
cites = {0},
citedby = {0},
pages = {81-93},
booktitle = {Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
editor = {Hee-Kap Ahn and Chan-Su Shin},
volume = {8889},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-13074-3},
}