Unique Small Subgraphs Are Not Easier to Find

Given a pattern graph H of fixed size, and a host graph G guaranteed to contain at most one occurrence of a subgraph isomorphic to H, we show that both the problem of finding such an occurrence (if any) as well as the decision version of the problem are as hard as in the general case when G may contain several occurrences of H.

[1]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[2]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

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

[4]  Philip Bachman,et al.  Structure discovery in PPI networks using pattern-based network decomposition , 2009, Bioinform..

[5]  Haim Kaplan,et al.  Unique maximum matching algorithms , 1999, STOC '99.

[6]  Andrzej Lingas,et al.  Counting and detecting small subgraphs via equations and matrix multiplication , 2011, SODA '11.

[7]  Andrzej Lingas,et al.  Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication , 2007, ESA.

[8]  Dieter Kratsch,et al.  Finding and Counting Small Induced Subgraphs Efficiently , 1995, WG.

[9]  Noga Alon,et al.  Color-coding , 1995, JACM.

[10]  Krzysztof Kuchcinski,et al.  Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel , 2009, TODE.

[11]  Friedrich Eisenbrand,et al.  On the complexity of fixed parameter clique and dominating set , 2004, Theor. Comput. Sci..

[12]  Noga Alon,et al.  Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions , 1994, Algorithmica.

[13]  Noga Alon,et al.  Biomolecular network motif counting and discovery by color coding , 2008, ISMB.

[14]  Bernd Voigt,et al.  Finding Minimally Weighted Subgraphs , 1991, WG.

[15]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[16]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[17]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[18]  Raimund Seidel,et al.  On the all-pairs-shortest-path problem , 1992, STOC '92.

[19]  Victor Y. Pan,et al.  Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..

[20]  Alon Itai,et al.  Finding a Minimum Circuit in a Graph , 1978, SIAM J. Comput..

[21]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.