Crown Structures for Vertex Cover Kernelization

Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed. One, based on linear programming, has been in prior use and is known to produce predictable results, although it was not previously associated with crowns. The second, based on crown structures, is newer and much faster, but produces somewhat variable results. These two methods are studied and compared both theoretically and experimentally with each other and with older, more primitive kernelization algorithms. Properties of crowns and methods for identifying them are discussed. Logical connections between linear programming and crown reductions are established. It is shown that the problem of finding an induced crown-free subgraph, and the problem of finding a crown of maximum size in an arbitrary graph, are solvable in polynomial time.

• Type: Journal
• Year: 2007
• Where: MST
• Authors: Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters
• Keywords: Classic Vertex, Kernelization Algorithms, Linear Programming, MST 2007