Skip to main content
Article thumbnail
Location of Repository

Fast, effective vertex cover kernelization: a tale of two algorithms

By Faisal N. Abu-khzam, Michael A. Langston and W. Henry Suters

Abstract

Two kernelization methods for the vertex cover problem are investigated. The first, LP-kernelization, has been in prior use and is known to produce predictable results. The second, crown reduction, is newer and faster but generates more variable results. Previously-unknown connections between these powerful methods are established. It is also shown that the problem of finding an induced crown-free subgraph in an ar-bitrary graph is decidable in polynomial time. Applications of crown structures are discussed.

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.5535
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.utk.edu/~library... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.