Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality

TL;DR

This paper introduces new algorithms with improved delay bounds for enumerating all connected induced subgraphs of a large fixed size in a graph, which is useful in various practical fields.

Contribution

The paper proposes a novel neighborhood operator and three algorithms with better delay bounds for enumerating connected induced subgraphs of size k.

Findings

Three algorithms with delay bounds of O(k·min{(n−k),kΔ}·(k log Δ + log n)), O(k·min{(n−k),kΔ}· n), and O(k^2·min{(n−k),kΔ}· min{k,Δ}) are introduced.

The algorithms improve upon the current best delay bound of O(k^2Δ) under certain conditions.

Exponential space is required for the first two algorithms to achieve these improvements.

Abstract

The problem of enumerating all connected induced subgraphs of a given order $k$ from a given graph arises in many practical applications: bioinformatics, information retrieval, processor design,to name a few. The upper bound on the number of connected induced subgraphs of order $k$ is $n\cdot\frac{(e\Delta)^{k}}{(\Delta-1)k}$, where $\Delta$ is the maximum degree in the input graph $G$ and $n$ is the number of vertices in $G$. In this short communication, we first introduce a new neighborhood operator that is the key to design reverse search algorithms for enumerating all connected induced subgraphs of order $k$. Based on the proposed neighborhood operator, three algorithms with delay of $O(k\cdot min\{(n-k),k\Delta\}\cdot(k\log{\Delta}+\log{n}))$, $O(k\cdot min\{(n-k),k\Delta\}\cdot n)$ and $O(k^2\cdot min\{(n-k),k\Delta\}\cdot min\{k,\Delta\})$ respectively are proposed. The first two algorithms require exponential space to improve upon the current best delay bound $O(k^2\Delta)$\cite{4} for this problem in the case $k>\frac{n\log{\Delta}-\log{n}-\Delta+\sqrt{n\log{n}\log{\Delta}}}{\log{\Delta}}$ and $k>\frac{n^2}{n+\Delta}$ respectively.