Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs

DOI10.1007/978-3-662-44465-8_43zbMath1426.68129OpenAlexW21966713WikidataQ56976982 ScholiaQ56976982MaRDI QIDQ2922637

Nils M. Kriege, Petra Mutzel

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_43

zbMATH Keywords

tree decompositionseries-parallel graphmaximum common subgraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (4)

A quantum Jensen-Shannon graph kernel for unattributed graphs ⋮ On maximum common subgraph problems in series-parallel graphs ⋮ Finding Largest Common Substructures of Molecules in Quadratic Time ⋮ Unnamed Item

This page was built for publication: Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs