Finding maximum common biconnected subgraphs in series-parallel graphs

DOI10.1007/978-3-662-44465-8_43MaRDI QIDQ2922637zbMATH OpenOpenAlexWikidataFDO

Authors Nils 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

maximum common subgraphseries-parallel graphtree decomposition

Mathematics Subject Classification ID

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

Recommendations

• On maximum common subgraph problems in series-parallel graphs
• On maximum common subgraph problems in series-parallel graphs
• On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree
• Algorithms and Computation
• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees

Cited in

(8)

• A quantum Jensen-Shannon graph kernel for unattributed graphs
• On maximum common subgraph problems in series-parallel graphs
• Maximum series-parallel subgraph
• On maximum common subgraph problems in series-parallel graphs
• Finding largest common substructures of molecules in quadratic time
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
• scientific article; zbMATH DE number 7625171 (Why is no real title available?)
• Finding the maximum subsequence sum on interconnection networks

This page was built for publication: Finding maximum common biconnected subgraphs in series-parallel graphs

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