Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective

04/16/2020
by   Hans Bodlaender, et al.
0

We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced subgraphs. We show a dichotomy for the former problem restricted to (H_1,H_2)-free graphs and a dichotomy for the latter problem restricted to H-free graphs. We find that there exists an infinite family of graphs H such that Vertex Steiner Tree is polynomial-time solvable for H-free graphs, whereas there exist only two graphs H for which this holds for Edge Steiner Tree. We also find that Edge Steiner Tree is polynomial-time solvable for (H_1,H_2)-free graphs if and only if the treewidth of the class of (H_1,H_2)-free graphs is bounded (subject to P ≠ NP). To obtain the latter result, we determine all pairs (H_1,H_2) for which the class of (H_1,H_2)-free graphs has bounded treewidth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2022

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

A graph is O_k-free if it does not contain k pairwise vertex-disjoint an...
research
03/12/2020

Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics

We consider the problem of computing a Steiner tree of minimum cost unde...
research
06/02/2020

Fast Algorithms for Join Operations on Tree Decompositions

Treewidth is a measure of how tree-like a graph is. It has many importan...
research
09/26/2017

Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application

We analyze some local properties of sparse Erdos-Renyi graphs, where d(n...
research
08/28/2018

On Some Combinatorial Problems in Cographs

The family of graphs that can be constructed from isolated vertices by d...
research
10/18/2022

First Order Logic on Pathwidth Revisited Again

Courcelle's celebrated theorem states that all MSO-expressible propertie...
research
01/13/2020

One-Clock Priced Timed Games are PSPACE-hard

The main result of this paper is that computing the value of a one-clock...

Please sign up or login with your details

Forgot password? Click here to reset