Parameterized algorithms and data reduction for the short secluded s-t-path problem

by   René van Bevern, et al.

Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we search for a simple s-t-path with at most k vertices and at most ℓ neighbors. For graphs with constant crossing number, we provide a subexponential 2^O(√(n))-time algorithm, prove a matching lower bound, and show a polynomial-time data reduction algorithm that reduces any problem instance to an equivalent instance (a so-called problem kernel) of size polynomial in the vertex cover number of the input graph. In contrast, we show that the problem in general graphs is hard to preprocess. We obtain a 2^O(ω)·ℓ^2· n-time algorithm for graphs of treewidth ω, show that there is no problem kernel with size polynomial in ω, yet show a problem kernels with size polynomial in the feedback edge number of the input graph and with size polynomial in the feedback vertex number, k, and ℓ.



There are no comments yet.



Parameterized algorithms and data reduction for safe convoy routing

We study a problem that models safely routing a convoy through a transpo...

Structurally Parameterized d-Scattered Set

In d-Scattered Set we are given an (edge-weighted) graph and are asked t...

A polynomial kernel for 3-leaf power deletion

A graph G is an ℓ-leaf power of a tree T if V(G) is equal to the set of ...

Subset Feedback Vertex Set in Chordal and Split Graphs

In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a gr...

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst...

Kernelization Lower Bounds for Finding Constant Size Subgraphs

Kernelization is an important tool in parameterized algorithmics. The go...

FPT and kernelization algorithms for the k-in-a-tree problem

The three-in-a-tree problem asks for an induced tree of the input graph ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.