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… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Blog articles referencing this paper