Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

Faster Algorithms for the Maximum Common Subtree Isomorphism ProblemAndre Droschinsky, Nils M. Kriege, Petra Mutzel. mfcs 2016: [doi]

runs on WebDSL