Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters

by   Matthias Bentert, et al.

In the presented paper we study the Length-Bounded Cut problem for special graph classes as well as from a parameterized-complexity viewpoint. Here, we are given a graph G, two vertices s and t, and positive integers β and λ. The task is to find a set of edges F of size at most β such that every s-t-path of length at most λ in G contains some edge in F. Bazgan et al. conjectured that Length-Bounded Cut admits a polynomial-time algorithm if the input graph G is a proper interval graph. We confirm this conjecture by showing a dynamic-programming based polynomial-time algorithm. We strengthen the W[1]-hardness result of Dvořák and Knop. Our reduction is shorter, seems simpler to describe, and the target of the reduction has stronger structural properties. Consequently, we give W[1]-hardness for the combined parameter pathwidth and maximum degree of the input graph. Finally, we prove that Length-Bounded Cut is W[1]-hard for the feedback vertex number. Both our hardness results complement known XP algorithms.


page 1

page 2

page 3

page 4


Vertebrate interval graphs

A vertebrate interval graph is an interval graph in which the maximum si...

Computing Subset Feedback Vertex Set via Leafage

Chordal graphs are characterized as the intersection graphs of subtrees ...

Complexity of computing the anti-Ramsey numbers

The anti-Ramsey numbers are a fundamental notion in graph theory, introd...

Computational Complexity of Testing Proportional Justified Representation

We consider a committee voting setting in which each voter approves of a...

On Happy Colorings, Cuts, and Structural Parameterizations

We study the Maximum Happy Vertices and Maximum Happy Edges problems. Th...

An O^*(1.84^k) Parameterized Algorithm for the Multiterminal Cut Problem

We study the multiterminal cut problem, which, given an n-vertex graph w...

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

The notion of Turing kernelization investigates whether a polynomial-tim...