Unbreakable Decomposition in Close-to-Linear Time

TL;DR

This work shows the first close-to-linear time parameterized algorithm that computes an unbreakable decomposition of $G$, where each bag has adhesion at most $O(k/\epsilon)$ and computes a $(O(k/\epsilon), k)$ unbreakable tree decomposition.

Abstract

Unbreakable decomposition, introduced by Cygan et al. (SICOMP'19) and Cygan et al. (TALG'20), has proven to be one of the most powerful tools for parameterized graph cut problems in recent years. Unfortunately, all known constructions require at least $Ω_k\left(mn^2\right)$ time, given an undirected graph with $n$ vertices, $m$ edges, and cut-size parameter $k$. In this work, we show the first close-to-linear time parameterized algorithm that computes an unbreakable decomposition. More precisely, for any $0<ε\leq 1$, our algorithm runs in time $2^{O(\frac{k}ε \log \frac{k}ε)}m^{1 + ε}$ and computes a $(O(k/ε), k)$ unbreakable tree decomposition of $G$, where each bag has adhesion at most $O(k/ε)$. This immediately opens up possibilities for obtaining close-to-linear time algorithms for numerous problems whose only known solution is based on unbreakable decomposition.

Theorems & Definitions (68)

• Theorem 1.1
• Theorem 1.2
• Definition 3.1: Unbreakablility
• Definition 3.2: Tree Decomposition
• Definition 3.3: Unbreakable Decomposition
• Definition 3.4: Disjoint Cuts
• Definition 3.5: Mincut Covers
• Theorem 3.6
• Definition 4.1: Balanced Origin
• Lemma 4.2