Domination and Cut Problems on Chordal Graphs with Bounded Leafage

08/04/2022
by   Esther Galby, et al.
0

The leafage of a chordal graph G is the minimum integer l such that G can be realized as an intersection graph of subtrees of a tree with l leaves. We consider structural parameterization by the leafage of classical domination and cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018, Algorithmica 2020] proved, among other things, that Dominating Set on chordal graphs admits an algorithm running in time 2^O(l^2) n^O(1). We present a conceptually much simpler algorithm that runs in time 2^O(l) n^O(1). We extend our approach to obtain similar results for Connected Dominating Set and Steiner Tree. We then consider the two classical cut problems MultiCut with Undeletable Terminals and Multiway Cut with Undeletable Terminals. We prove that the former is W[1]-hard when parameterized by the leafage and complement this result by presenting a simple n^O(l)-time algorithm. To our surprise, we find that Multiway Cut with Undeletable Terminals on chordal graphs can be solved, in contrast, in n^O(1)-time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2021

Faster Cut-Equivalent Trees in Simple Graphs

Let G = (V, E) be an undirected connected simple graph on n vertices. A ...
research
12/23/2019

A near-linear time minimum Steiner cut algorithm for planar graphs

We consider the Minimum Steiner Cut problem on undirected planar graphs ...
research
10/07/2019

Faster Minimum k-cut of a Simple Graph

We consider the (exact, minimum) k-cut problem: given a graph and an int...
research
03/05/2019

Cut Polytopes of Minor-free Graphs

The cut polytope of a graph G is the convex hull of the indicator vector...
research
01/03/2022

A New Modeling of Classical Folds in Computational Origami

This paper shows a cut along a crease on an origami sheet makes simple m...
research
11/27/2018

A Schur Complement Cheeger Inequality

Cheeger's inequality shows that any undirected graph G with minimum nonz...
research
11/24/2021

A Classical Algorithm Which Also Beats 1/2+2/π1/√(D) For High Girth MAX-CUT

We give a simple classical algorithm which provably achieves the perform...

Please sign up or login with your details

Forgot password? Click here to reset