A Cubic Kernel for Feedback Vertex Set and Loop Cutset

The Feedback Vertex Set problem on unweighted, undirected graphs is considered. Improving upon a result by Burrage et al. (Proceedings 2nd International Workshop on Parameterized and Exact Computation, pp. 192–202, 2006 ), we show that this problem has a kernel with O ( k 3 ) vertices, i.e., there i...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 46; no. 3; pp. 566 - 597
Main Authors:	Bodlaender, Hans L., van Dijk, Thomas C.
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.04.2010 Springer Nature B.V
Subjects:	Algorithms Approximation Computer Science Data analysis Graph theory Graphs Linear programming Polynomials Studies Theory of Computation Algorithms Preprocessing Feedback vertex set Kernelization algorithms Loop cutset Graphs Polynomial kernels Data reduction Fixed parameter tractability
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!