On maximum common subgraph problems in series-parallel graphs

Abstract The complexity of the maximum common connected subgraph problem in partial k -trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial 2 -trees. On the other hand, the problem is known to be NP-hard in vertex-labeled partial 11 -trees of bounded degree. We consider series–parallel graphs, i.e., partial 2 -trees. We show that the problem remains NP-hard in biconnected series–parallel graphs with all but one vertex of degree 3 or less. A positive complexity result is presented for a related problem of high practical relevance which asks for a maximum common connected subgraph that preserves blocks and bridges of the input graphs. We present a polynomial time algorithm for this problem in series–parallel graphs, which utilizes a combination of BC- and SP-tree data structures to decompose both graphs.

[1]  Naomi Nishimura,et al.  Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees , 1994, SWAT.

[2]  Nils M. Kriege,et al.  Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs , 2014, MFCS.

[3]  Jan Ramon,et al.  Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth , 2008, ECML/PKDD.

[4]  Tatsuya Akutsu,et al.  A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree , 2013, Algorithms.

[5]  Robin Thomas,et al.  On the complexity of finding iso- and other morphisms for partial k-trees , 1992, Discret. Math..

[6]  Maurice Bruynooghe,et al.  An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules , 2008, Discovery Science.

[7]  T. Akutsu.  A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree , 1993 .

[8]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[9]  Tatsuya Akutsu,et al.  On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree , 2012, ISAAC.

[10]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[11]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[12]  Jens Vygen,et al.  The edge-disjoint paths problem is NP-complete for series-parallel graphs , 2001, Discret. Appl. Math..

[13]  Maurice Bruynooghe,et al.  A Polynomial-time Metric for Outerplanar Graphs , 2007, MLG.

[14]  Jan Ramon,et al.  Efficient frequent connected subgraph mining in graphs of bounded tree-width , 2010, LWA.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[17]  Maciej M. Syslo.  The Subgraph Isomorphism Problem for Outerplanar Graphs , 1982, Theor. Comput. Sci..

[18]  Maurice Bruynooghe,et al.  A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics , 2013, Annals of Mathematics and Artificial Intelligence.

[19]  Nils M. Kriege,et al.  On Maximum Common Subgraph Problems in Series-Parallel Graphs , 2014, IWOCA.

[20]  Markus Chimani,et al.  A Tighter Insertion-Based Approximation of the Crossing Number , 2011, ICALP.

[21]  Naomi Nishimura,et al.  The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees , 1996, Theor. Comput. Sci..

[22]  D. Matula.  Subtree Isomorphism in O(n5/2) , 1978 .

[23]  Luc De Raedt,et al.  Effective feature construction by maximum common subgraph sampling , 2010, Machine Learning.