Tight Bounds for Graph Homomorphism and Subgraph Isomorphism

We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time |V(H)|o(|V(G)|). We also show an exponential-time reduction from G raph H omomorphism to S ubgraph I somorphism . This rules out (subject to ETH) a possibility of |V(H)|o(|V(H)|)-time algorithm deciding if graph G is a subgraph of H. For both problems our lower bounds asymptotically match the running time of brute-force algorithms trying all possible mappings of one graph into another. Thus, our work closes the gap in the known complexity of these fundamental problems.

[1]  Andreas Björklund,et al.  Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..

[2]  Fedor V. Fomin,et al.  Exact Algorithms for Graph Homomorphisms , 2005, Theory of Computing Systems.

[3]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[4]  Omid Amini,et al.  Counting Subgraphs via Homomorphisms , 2009, SIAM J. Discret. Math..

[5]  Dániel Marx,et al.  Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.

[6]  Magnus Wahlström.  New Plain-Exponential Time Classes for Graph Homomorphism , 2009, CSR.

[7]  Ge Xia,et al.  Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..

[8]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[9]  Dieter Kratsch,et al.  10441 Abstracts Collection - Exact Complexity of NP-hard Problems , 2010, Exact Complexity of NP-hard Problems.

[10]  Paweł Rzewski.  Exact algorithm for graph homomorphism and locally injective graph homomorphism , 2014 .

[11]  Pawel Rzka.zewski.  Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism , 2013 .

[12]  Magnus Wahlström,et al.  New Plain-Exponential Time Classes for Graph Homomorphism , 2009, Theory of Computing Systems.

[13]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

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

[15]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[16]  Fedor V. Fomin,et al.  Lower Bounds for the Graph Homomorphism Problem , 2015, ICALP.

[17]  Patrick Traxler.  The Time Complexity of Constraint Satisfaction , 2008, IWPEC.

[18]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[19]  Thore Husfeldt,et al.  Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331) , 2013, Dagstuhl Reports.