DeepAI
Log In Sign Up

TS-Reconfiguration of k-Path Vertex Covers in Caterpillars

03/22/2022
βˆ™
by   Duc A. Hoang, et al.
βˆ™
0
βˆ™

A k-path vertex cover (k-PVC) of a graph G is a vertex subset I such that each path on k vertices in G contains at least one member of I. Imagine that a token is placed on each vertex of a k-PVC. Given two k-PVCs I, J of a graph G, the k-Path Vertex Cover Reconfiguration (k-PVCR) under Token Sliding (𝖳𝖲) problem asks if there is a sequence of k-PVCs between I and J where each intermediate member is obtained from its predecessor by sliding a token from some vertex to one of its unoccupied neighbors. This problem is known to be π™Ώπš‚π™Ώπ™°π™²π™΄-complete even for planar graphs of maximum degree 3 and bounded treewidth and can be solved in polynomial time for paths and cycles. Its complexity for trees remains unknown. In this paper, for k β‰₯ 4, we present a polynomial-time algorithm that solves k-PVCR under 𝖳𝖲 for caterpillars (i.e., trees formed by attaching leaves to a path).

READ FULL TEXT

page 1

page 5

βˆ™ 11/08/2019

Reconfiguring k-path vertex covers

A vertex subset I of a graph G is called a k-path vertex cover if every ...
βˆ™ 04/12/2022

Galactic Token Sliding

Given a graph G and two independent sets I_s and I_t of size k, the inde...
βˆ™ 03/31/2022

On Reconfiguration Graph of Independent Sets under Token Sliding

An independent set of a graph G is a vertex subset I such that there is ...
βˆ™ 04/22/2020

Some results on Vertex Separator Reconfiguration

We present the first results on the complexity of the reconfiguration of...
βˆ™ 04/11/2022

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

Temporal graphs naturally model graphs whose underlying topology changes...
βˆ™ 03/16/2019

Token Swapping on Trees

The input to the token swapping problem is a graph with vertices v_1, v_...
βˆ™ 12/12/2019

Short simplex paths in lattice polytopes

We consider the problem of optimizing a linear function over a lattice p...