Papers
Topics
Authors
Recent
Search
2000 character limit reached

Faster algorithms for counting subgraphs in sparse graphs

Published 5 May 2018 in cs.CC | (1805.02089v5)

Abstract: Given a kk-node pattern graph HH and an nn-node host graph GG, the subgraph counting problem asks to compute the number of copies of HH in GG. In this work we address the following question: can we count the copies of HH faster if GG is sparse? We answer in the affirmative by introducing a novel tree-like decomposition for directed acyclic graphs, inspired by the classic tree decomposition for undirected graphs. This decomposition gives a dynamic program for counting the homomorphisms of HH in GG by exploiting the degeneracy of GG, which allows us to beat the state-of-the-art subgraph counting algorithms when GG is sparse enough. For example, we can count the induced copies of any kk-node pattern HH in time 2O(k2)O(n0.25k+2log⁡n)2^{O(k^2)} O(n^{0.25k + 2} \log n) if GG has bounded degeneracy, and in time 2O(k2)O(n0.625k+1log⁡n)2^{O(k^2)} O(n^{0.625k + 1} \log n) if GG has bounded average degree. These bounds are instantiations of a more general result, parameterized by the degeneracy of GG and the structure of HH, which generalizes classic bounds on counting cliques and complete bipartite graphs. We also give lower bounds based on the Exponential Time Hypothesis, showing that our results are actually a characterization of the complexity of subgraph counting in bounded-degeneracy graphs.

Authors (1)
Citations (25)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.