Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree

We consider the maximum common connected edge subgraph problem and the maximum common connected induced subgraph problem for simple graphs with labeled vertices (or labeled edges). The former is to...

[1]  Philippe Vismara,et al.  Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms , 2008, MCO.

[2]  Peter Willett,et al.  Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

[3]  Svetha Venkatesh,et al.  Video indexing and similarity retrieval by largest common subgraph detection using decision trees , 2001, Pattern Recognit..

[4]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  Kiyoko F. Aoki-Kinoshita,et al.  Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees , 2003, ISAAC.

[6]  Mohammad Taghi Hajiaghayi,et al.  Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth , 2007, J. Comput. Syst. Sci..

[7]  Petteri Kaski,et al.  On the Number of Connected Sets in Bounded Degree Graphs , 2014, WG.

[8]  Andreas Björklund,et al.  The traveling salesman problem in bounded degree graphs , 2012, TALG.

[9]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[10]  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.

[11]  Jörg Flum,et al.  Fixed-Parameter Tractability, Definability, and Model-Checking , 1999, SIAM J. Comput..

[12]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

[13]  Pim van 't Hof,et al.  Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs , 2015, Theor. Comput. Sci..

[14]  Nils M. Kriege,et al.  On maximum common subgraph problems in series-parallel graphs , 2014, Eur. J. Comb..

[15]  Ina Koch,et al.  Enumerating all connected maximal common subgraphs in two graphs , 2001, Theor. Comput. Sci..

[16]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[17]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[18]  Nagiza F. Samatova,et al.  The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[19]  Maciej M. SysŁ.  The subgraph isomorphism problem for outerplanar graphs , 1982 .

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

[21]  Faisal N. Abu-Khzam,et al.  On the complexity of various parameterizations of common induced subgraph isomorphism , 2017, Theor. Comput. Sci..

[22]  Faisal N. Abu-Khzam.  Maximum common induced subgraph parameterized by vertex cover , 2014, Inf. Process. Lett..

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

[24]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

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

[26]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.

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

[28]  David R. Wood,et al.  The treewidth of line graphs , 2012, J. Comb. Theory, Ser. B.