Lower Bounds for Subgraph Isomorphism
نویسنده
چکیده
We consider the computational complexity of determining whether an Erdős-Rényi random graph contains a subgraph isomorphic to a fixed pattern, such as a clique or cycle of constant size. We give an overview of unconditional lower bounds for this problem, focusing on circuits and formulas in the AC 0 and monotone settings. 1 Background and preliminaries The subgraph isomorphism problem is the computational task of determining whether a “host” graph H contains a copy of a “pattern” G as a subgraph. When both G and H are given as input, this is a classic NP -complete problem which generalizes both maximum clique and hamiltonian cycle [21]. We refer to the G-subgraph isomorphism problem in the setting whether the pattern G is fixed and H alone is given as input. This family of problems, which includes the k-clique and k-cycle problems for fixed k, are each solvable in polynomial time O(n|V (G)|) by the obvious exhaustive search.1 Faster algorithms are known in many cases. For example, k-cycle has an O(nω) time algorithm where ω < 2.38 is the exponent of matrix multiplication [2], while k-clique is solvable in O(nωdk/3e) time [27]. Additional upper bounds are based on invariants of G and H (see [25] for a survey), such as an O(nk+1) time algorithm for patterns of tree-width k [28]. The focus of this article is lower bounds: impossibility results which show, unconditionally, that the G-subgraph isomorphism problem cannot be solved with insufficient computational resources, such as time or space. Conditionally, it is known that the Exponential Time Hypothesis implies that k-clique requires time nΩ(k) [9] and that G-subgraph isomorphism Throughout this article, asymptotic notation (O(·), Ω(·), etc.), whenever bounding a function of n, hides constants that may depend on G.
منابع مشابه
Quantum Algorithms and Lower Bounds for Independent Set and Subgraph Isomorphism Problem
The study of the quantum query complexity for some graph problems is an interesting area in quantum computing. Only for a few graph problems there are quantum algorithms and lower bounds known. We present some new quantum query and quantum time algorithms and quantum query complexity bounds for the maximal and maximum independent set problem and the graph and subgraph isomorphism problem.
متن کاملImproved Lower Bounds for Graph Embedding Problems
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector Crafting, and show that these cannot be solved in time 2o(|s|/ log |s|), unless the Exponential Time Hypothesis fails. These results are used to obtain simplified hardness results for several ...
متن کامل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 Graph Homomorphism to Subgraph Isomorphism. 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 o...
متن کاملTight Bounds for Subgraph Isomorphism and Graph Homomorphism
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 . Combined with the reduction of Cygan, Pachocki, and Soca la, our result rules out (subject to ETH) a possibility of |V (G)|o(|V -time algorithm deciding if graph H is a subgraph of G. For both problems our lower bounds asymptotically matc...
متن کاملFast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V,E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R ⊆ V such that the induced subgraph on R, G[R], is r-regular. We give an O(c) time algorithm for these problems for any fixed constant r, where c is a positive constant strictly less than 2, solving a well known open problem. These algorithms are then genera...
متن کامل