2005 · 18 citations · 9 references
ComputingComputer ScienceAlgorithmsComputational GeometryData StructuresGraph AlgorithmsGraph TheoryKernel MethodsGraph KernelsGraph ProcessingKernelizationPolynomial Time ComplexityPolynomial-time AlgorithmsPolynomial-time Reductions
Summary form only given. 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.
9
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
Jonathan F. Buss, Judy Goldsmith · SIAM Journal on Computing · 1993 · 309 citations