The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

Authors:
Sounaka Mishra;Venkatesh Raman;Saket Saurabh;Somnath Sikdar;C. R. Subramanian
Affiliations:
The Indian Institute of Technology, Department of Mathematics, Chennai, India;The Institute of Mathematical Sciences, Chennai, India;The Institute of Mathematical Sciences, Chennai, India;RWTH Aachen University, Department of Computer Science, 52056, Aachen, Germany;The Institute of Mathematical Sciences, Chennai, India
Venue:
Algorithmica
Year:
2011

Citing 0
Cited 5

Note on maximal bisection above tight lower bound

Information Processing Letters
Paths, flowers and vertex cover

ESA'11 Proceedings of the 19th European conference on Algorithms
Generalized above guarantee vertex cover and r-partization

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Constraint satisfaction problems parameterized above or below tight bounds: a survey

The Multivariate Algorithmic Revolution and Beyond
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph is König-Egerváry if the size of a minimum vertex cover equals that of a maximum matching in the graph. These graphs have been studied extensively from a graph-theoretic point of view. In this paper, we introduce and study the algorithmic complexity of finding König-Egerváry subgraphs of a given graph. In particular, given a graph G and a nonnegative integer k, we are interested in the following questions: does there exist a set of k vertices (edges) whose deletion makes the graph König-Egerváry? does there exist a set of k vertices (edges) that induce a König-Egerváry subgraph? We show that these problems are NP-complete and study their complexity from the points of view of approximation and parameterized complexity. Towards this end, we first study the algorithmic complexity of Above Guarantee Vertex Cover, where one is interested in minimizing the additional number of vertices needed beyond the maximum matching size for the vertex cover. Further, while studying the parameterized complexity of the problem of deleting k vertices to obtain a König-Egerváry graph, we show a number of interesting structural results on matchings and vertex covers which could be useful in other contexts.