Abstract
We give a O(maxû12k, (4lgk)ký · n ω) algorithm for testing whether an undirected graph on n vertices has a feedback vertex set of size at most k where O(nω) is the complexity of the best matrix multiplication algorithm. The previous best fixed parameter tractable algorithm for the problem took O((2k + 1)k n2) time. The main technical lemma we prove and use to develop our algorithm is that that there exists a constant c such that, if an undirected graph on n vertices with minimum degree 3 has a feedback vertex set of size at most c√n, then the graph will have a cycle of length at most 12. This lemma may be of independent interest.
We also show that the feedback vertex set problem can be solved in O(dkkn) for some constant d in regular graphs, almost regular graphs and (fixed) bounded degree graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Alber, H. L. Bodlaender, H. Fernau and R. Niedermeier, ‘Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs’, Lecture Notes in Computer Science 1851 (2000) 93–110; to appear in Algorithmica.
J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamand and U. Stege, ‘Refined Search Tree Techniques for Dominating Set on Planar Graphs’, Lecture Notes in Computer Science 2136 (2001) 111–122.
N. Bansal and V. Raman, ‘Upper Bounds for MAX-SAT further improved, Lecture Notes in Computer Science 1741 (1999) 247–258.
R. Bar-Yehuda, D. Geiger, J. Naor, R. M. Roth, ‘Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference’, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, (1994) 344–354.
A Becker, R. Bar-Yehuda and D. Geiger, ‘Random Algorithms for the Loop Cutset Problem’, Journal of Artificial Intelligence Research 12 (2000) 219–234.
J. Chen, I. A. Kanj and W. Jia, ‘Vertex Cover, Further Observations and Further Improvements’, Lecture Notes in Computer Science 1665 (1999) 313–324.
J. Chen, D. K. Friesen, W. Jia and I. A. Kanj, ‘Using Nondeterminism to Design Efficient Deterministic Algorithms’ in Proceedings of 21st Foundations of Software Technology and Theoretical Computer Science (FST TCS) conference, Lecture Notes in Computer Science, Springer Verlag 2245 (2001) 120–131.
R. Downey and M. R. Fellows, ‘Parameterized Complexity’, Springer Verlag 1998.
P. Erdos and L. Posa, ‘On the maximal number of disjoint circuits of a graph’, Publ Math. Debrecen 9 (1962) 3–12.
A. Itai and M. Rodeh, “Finding a minimum circuit in a graph”, SIAM Journal on Computing, 7 (1978) 413–423.
R. Niedermeier and P. Rossmanith, ‘Upper Bounds for Vertex Cover: Further Improved’, in Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 1563 (1999) 561–570.
R. Niedermeier and P. Rossmanith, ‘New Upper Bounds for Maximum Satisfiability’, Journal of Algorithms 36 (2000) 63–68.
V. Raman, ‘Parameterized Complexity,’ in Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India (1997), 1–18.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raman, V., Saurabh, S., Subramanian, C.R. (2002). Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive