Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem

TL;DR

This paper advances understanding of the Steiner Forest problem on graphs excluding certain subgraphs by providing new polynomial-time algorithms and fixed-parameter tractability results, filling a key gap in the complexity classification.

Contribution

It introduces four polynomial-time algorithms for Steiner Forest on specific $H$-subgraph-free graphs and establishes fixed-parameter tractability results based on small deletion sets.

Findings

Steiner Forest is polynomial-time solvable for graphs with a 2-deletion set of size at most 2.

Steiner Forest is FPT when parameterized by vertex cover size.

NP-complete for graphs with a 3-deletion set of size 2.

Abstract

We study Steiner Forest on $H$-subgraph-free graphs, that is, graphs that do not contain some fixed graph $H$ as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the complexity of many problems on $H$-subgraph-free graphs. However, in contrast to e.g. the related Steiner Tree problem, Steiner Forest falls outside this framework. Hence, the complexity of Steiner Forest on $H$-subgraph-free graphs remained tantalizingly open. In this paper, we make significant progress towards determining the complexity of Steiner Forest on $H$-subgraph-free graphs. Our main results are four novel polynomial-time algorithms for different excluded graphs $H$ that are central to further understand its complexity. Along the way, we study the complexity of Steiner Forest for graphs with a small $c$-deletion set, that is, a small set $S$ of vertices such that each component of $G-S$ has size at most $c$. Using this parameter, we give two noteworthy algorithms that we later employ as subroutines. First, we prove Steiner Forest is FPT parameterized by $|S|$ when $c=1$ (i.e. the vertex cover number). Second, we prove Steiner Forest is polynomial-time solvable for graphs with a 2-deletion set of size at most 2. The latter result is tight, as the problem is NP-complete for graphs with a 3-deletion set of size 2.