Theory of Computing Systems

, Volume 41, Issue 3, pp 411–430 | Cite as

Crown Structures for Vertex Cover Kernelization

  • Faisal N. Abu-Khzam
  • Michael R. Fellows
  • Michael A. Langston
  • W. Henry Suters


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.


Linear Programming Problem Vertex Cover Maximum Match Vertex Cover Problem Linear Programming Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  1. 1.Division of Computer Science and Mathematics, Lebanese American University, ChouranBeirutLebanon
  2. 2.School of Electrical Engineering and Computer Science, University of NewcastleCallaghan, NSW 2308Australia
  3. 3.Department of Computer Science, University of TennesseeKnoxville, TN 37996-3450USA
  4. 4.Department of Mathematics and Computer Science, Carson-Newman College, CN Box 71958Jefferson City, TN 37760USA

Personalised recommendations