Faster algorithms for the maximum common subtree isomorphism problem

DOI10.4230/LIPICS.MFCS.2016.33MaRDI QIDQ4608592zbMATH OpenFDO

Authors Andre Droschinsky, Nils Kriege, Petra Mutzel

Publication date 21 March 2018

Full work available at URL https://arxiv.org/abs/1602.07210

zbMATH Keywords

enumeration algorithmsmaximum common subtreemaximum weight bipartite matchingsMCS

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
• On the complexity of finding a largest common subtree of bounded degree
• Faster Subtree Isomorphism
• On the complexity of finding a largest common subtree of bounded degree
• Algorithms and Computation

Cited in

(13)

• Faster algorithms for subgraph isomorphism of k-connected partial k-trees
• Fixed-parameter tractability for the tree assembly problem
• On the complexity of finding a largest common subtree of bounded degree
• On the complexity of finding a largest common subtree of bounded degree
• Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
• Finding largest common substructures of molecules in quadratic time
• Speedy colorful subtrees
• Subtree isomorphism revisited
• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
• Faster Subtree Isomorphism
• Largest Weight Common Subtree Embeddings with Distance Penalties
• A BULT algorithm for tree isomorphism
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree

This page was built for publication: Faster algorithms for the maximum common subtree isomorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608592)