On Maximum Common Subgraph Problems in Series-Parallel Graphs

DOI10.1007/978-3-319-19315-1_18zbMath1401.05282arXiv1708.02772OpenAlexW2762733342MaRDI QIDQ2946055

Petra Mutzel, Nils M. Kriege, Florian Kurpicz

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

series-parallel graphsmaximum common subgraphblock and bridge preserving

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On maximum common subgraph problems in series-parallel graphs ⋮ Finding Largest Common Substructures of Molecules in Quadratic Time

This page was built for publication: On Maximum Common Subgraph Problems in Series-Parallel Graphs