EECS Publication
Fast, Effective Vertex Cover Kernelization: A Tale of Two Algorithms
Faisal N. Abu-Khzam, Michael A. Langston and W. Henry Suters
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 arbitrary graph is decidable in polynomial time. Applications of crown structures are discussed.
Published 2005-06-01 04:00:00 as ut-cs-05-558 (ID:160)