Next Article in Journal
Common Nearest Neighbor Clustering—A Benchmark
Next Article in Special Issue
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs
Previous Article in Journal
A New Greedy Insertion Heuristic Algorithm with a Multi-Stage Filtering Mechanism for Energy-Efficient Single Machine Scheduling Problems
Open AccessArticle

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
Author to whom correspondence should be addressed.
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).
This paper is an extended version of our paper published in the 25th International Symposium on Algorithms and Computation (ISAAC 2014).
Algorithms 2018, 11(2), 20;
Received: 11 October 2017 / Revised: 2 February 2018 / Accepted: 7 February 2018 / Published: 9 February 2018
(This article belongs to the Special Issue Reconfiguration Problems)
In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and and two vertex covers S and T of G 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 W [ 1 ] -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 W [ 1 ] -hard on bipartite graphs, is NP -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. View Full-Text
Keywords: reconfiguration; vertex cover; solution space; fixed-parameter tractability; bipartite graphs reconfiguration; vertex cover; solution space; fixed-parameter tractability; bipartite graphs
Show Figures

Figure 1

MDPI and ACS Style

Mouawad, A.E.; Nishimura, N.; Raman, V.; Siebertz, S. Vertex Cover Reconfiguration and Beyond. Algorithms 2018, 11, 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.

Article Access Map

Algorithms, EISSN 1999-4893, Published by MDPI AG
Back to TopTop