Vertex Cover Reconfiguration and Beyond†
Department of Informatics, University of Bergen, PB 7803, N-5020 Bergen, Norway
School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada
Institute of Mathematical Sciences, Chennai 600113, India
Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland
This paper is an extended version of our paper published in the 25th International Symposium on Algorithms and Computation (ISAAC 2014).
The work of Sebastian Siebertz is supported by the National Science Centre of Poland via POLONEZ Grant Agreement UMO-2015/19/P/ST6/03998, which has received funding from the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie Grant Agreement No. 665778).
Author to whom correspondence should be addressed.
Received: 11 October 2017 / Revised: 2 February 2018 / Accepted: 7 February 2018 / Published: 9 February 2018
In the Vertex Cover Reconfiguration (VCR) problem, given a graph G
, positive integers k
and two vertex covers S
of size at most k
, we determine whether S
can be transformed into T
by a sequence of at most ℓ
vertex additions or removals such that every operation results in a vertex cover of size at most k
. Motivated by results establishing the
-hardness of VCR when parameterized by ℓ
, we delineate the complexity of the problem restricted to various graph classes. In particular, we show that VCR remains
-hard on bipartite graphs, is
-hard, but fixed-parameter tractable on (regular) graphs of bounded degree and more generally on nowhere dense graphs and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Scifeed alert for new publications
Never miss any articles
matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
Define your Scifeed now
Share & Cite This Article
MDPI and ACS Style
Mouawad, A.E.; Nishimura, N.; Raman, V.; Siebertz, S. Vertex Cover Reconfiguration and Beyond. Algorithms 2018, 11, 20.
Mouawad AE, Nishimura N, Raman V, Siebertz S. Vertex Cover Reconfiguration and Beyond. Algorithms. 2018; 11(2):20.
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Siebertz, Sebastian. 2018. "Vertex Cover Reconfiguration and Beyond." Algorithms 11, no. 2: 20.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.