# Distributed Vertex Cover Reconfiguration

@article{CensorHillel2021DistributedVC, title={Distributed Vertex Cover Reconfiguration}, author={Keren Censor-Hillel and Yannic Maus and Shahar Romem Peled and Tigran Tonoyan}, journal={ArXiv}, year={2021}, volume={abs/2109.06601} }

Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most research has dealt with the decision problem of whether a reconfiguration schedule exists, and the complexity of finding one. A prime example is the reconfiguration of vertex covers. We initiate the study of batched vertex cover reconfiguration, which allows to reconfigure multiple vertices concurrently while requiring…

## 3 Citations

### Distributed Reconfiguration of Spanning Trees

- Mathematics, Computer ScienceArXiv
- 2022

A new reconﬁguration step, called k -simultaneous add and delete, is introduced, in which every node is allowed to add at most k edges and delete at mostK edges such that multiple nodes do not add or delete the same edge.

### Short and local transformations between (Δ+1)-colorings

- MathematicsArXiv
- 2022

Recoloring a graph is about (cid:28)nding a sequence of proper colorings of this graph from an initial coloring σ to a target coloring η . Each pair of consecutive colorings must di(cid:27)er on…

### Short and local transformations between ($\Delta+1$)-colorings

- Mathematics
- 2022

Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring σ to a target coloring η. Each pair of consecutive colorings must differ on exactly one…

## References

SHOWING 1-10 OF 50 REFERENCES

### Distributed Reconfiguration of Maximal Independent Sets

- Computer Science, MathematicsICALP
- 2019

In this paper, we investigate a distributed maximal independent set (MIS) reconfiguration problem, in which there are two maximal independent sets for which every node is given its membership status,…

### Vertex Cover Reconfiguration and Beyond

- MathematicsISAAC
- 2014

It is shown that VCR remains w[1]-hard on bipartite graphs, is NP-hard but fixed-parameter tractable on (regular) graphs of bounded degree, and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.

### Shortest Reconfiguration of Colorings Under Kempe Changes

- Mathematics, Computer ScienceSTACS
- 2020

The problem is NP-hard even on star graphs and it is shown that on such graphs it admits a constant-factor approximation algorithm and is fixed-parameter tractable when parameterized by the number k of colors.

### Reconfiguration of Vertex Covers in a Graph

- MathematicsIWOCA
- 2014

A linear-time algorithm is given to solve the problem for even-hole-free graphs, which include several well-known graphs, such as trees, interval graphs and chordal graphs, and gives an upper bound on \(k\) for which any pair of vertex covers in a graph G has a desired sequence.

### Introduction to Reconfiguration

- BusinessAlgorithms
- 2018

Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an…

### The complexity of change

- MathematicsSurveys in Combinatorics
- 2013

Many combinatorial problems can be formulated as "Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?". An example of such a question is: given two…

### Sliding Tokens on a Cactus

- MathematicsISAAC
- 2016

A polynomial-time algorithm for solving Sliding Token in case the graph G is a cactus is described and a no-instance may be easily deduced using this characterization.