Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

DOI10.1007/978-3-319-13075-0_7MaRDI QIDQ2942616zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel

Publication date 11 September 2015

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13075-0_7

zbMATH Keywords

Edmonds' algorithmmaximum common subgraph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Faster algorithms for the maximum common subtree isomorphism problem
• On the complexity of submap isomorphism and maximum common submap problems
• Polynomial-delay and polynomial-space enumeration of large maximal matchings
• New polynomial delay bounds for maximal subgraph enumeration by proximity search
• On the complexity of finding a largest common subtree of bounded degree
• On the complexity of finding a largest common subtree of bounded degree
• On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
• Combinatorial Pattern Matching
• Polynomial-time algorithms for the ordered maximum agreement subtree problem
• On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree

Cited in

(5)

• A fast discovery algorithm for large common connected induced subgraphs
• Constant time enumeration of bounded-size subtrees in trees and its application
• On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
• Faster algorithms for the maximum common subtree isomorphism problem
• New polynomial delay bounds for maximal subgraph enumeration by proximity search

This page was built for publication: Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

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