On exploiting degeneracy to count subgraphs

05/05/2018
by   Marco Bressan, et al.
0

Motivated by practical applications, we study the complexity of counting the copies of a k-node pattern graph H in an n-node graph G, parameterized by the degeneracy d of G. We develop the source tree decomposition of H, a tree decomposition designed to exploit the degeneracy of G algorithmically to count homomorphisms, and an associated measure of source-treewidth s(H). Combining a simple dynamic programming with inclusion-exclusion arguments, for any given H we can count the homomorphisms from H to G in time f(d,k) ·Õ(n^s(H)). This allows us to obtain fast algorithms by bounding s(H) for interesting classes of patterns. For instance, we can count the induced or non-induced copies of any pattern faster than the decades-old state-of-the-art O(n^ω k/3+2) algorithm of [Nešetřil et al., 1985] as long as d < n^0.721 or m < n^1.442, where m is the number of edges of G. We complement our upper bounds with almost-matching lower bounds based on the Exponential Time Hypothesis [Impagliazzo et al., 1998].

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/05/2018

On degeneracy and the parameterized complexity of subgraph counting

We study the complexity of counting the (induced) occurrences of a k-nod...
10/06/2021

Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

We study the fine-grained complexity of counting the number of colorings...
04/25/2019

Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time

We present an algorithm that takes as input an n-vertex planar graph G a...
08/29/2019

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

We consider the subgraph isomorphism problem where, given two graphs G (...
11/28/2018

Counting Complexity for Reasoning in Abstract Argumentation

In this paper, we consider counting and projected model counting of exte...
01/15/2020

Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space

A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivi...
05/14/2018

Exploiting Treewidth for Projected Model Counting and its Limits

In this paper, we introduce a novel algorithm to solve projected model c...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.