Vertex Covers Revisited: Indirect Certificates and FPT Algorithms

The classical NP-complete problem Vertex Cover requires us to determine whether a graph contains at most $k$ vertices that cover all edges. In spite of its intractability, the problem can be solved in FPT time for parameter $k$ by various techniques. In this paper, we present half a dozen new and simple FPT algorithms for Vertex Cover with respect to parameter $k$. For this purpose, we explore structural properties of vertex covers and use these properties to obtain FPT algorithms by iterative compression, colour coding, and indirect certificating methods. In particular, we show that every graph with a $k$-vertex cover admits an indirect certificate with at most $k/3$ vertices, which lays the foundation of three new FPT algorithms based on random partition and random selection.

[1]  Leizhen Cai,et al.  Alternating Path and Coloured Clustering , 2018, ArXiv.

[2]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[3]  Michal Pilipczuk,et al.  Parameterized Complexity of Eulerian Deletion Problems , 2012, Algorithmica.

[4]  Rossella Petreschi,et al.  Experimental comparison of 2-satisfiability algorithms , 1991 .

[5]  J. Moon,et al.  On cliques in graphs , 1965 .

[6]  Michael Lampis.  A kernel of order 2 k-c log k for vertex cover , 2011, Inf. Process. Lett..

[7]  Leizhen Cai,et al.  Finding Two Edge-Disjoint Paths with Length Constraints , 2016, WG.

[8]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[9]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[11]  Michael R. Fellows,et al.  Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover , 2004, IWPEC.

[12]  Venkatesh Raman,et al.  Solving minones-2-sat as Fast as vertex cover , 2010, MFCS.

[13]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[14]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[15]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.

[16]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[17]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[18]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..