A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
From MaRDI portal
Publication:1736548
DOI10.3390/a6010119zbMath1461.68140OpenAlexW2046820662WikidataQ115926164 ScholiaQ115926164MaRDI QIDQ1736548
Tatsuya Akutsu, Takeyuki Tamura
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6010119
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (4)
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs ⋮ Editorial: Special issue on graph algorithms ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- The subgraph isomorphism problem for outerplanar graphs
- Characterizations of outerplanar graphs
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
- Computing and Drawing Isomorphic Subgraphs
- On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree
- On the approximability of the maximum common subgraph problem
This page was built for publication: A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
