Faster fixed parameter tractable algorithms for undirected feedback vertex set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 241-248

  Raman, Venkatesh ^a   Saurabh, Saket ^a   Subramanian, C R ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DEGREE GRAPHS; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; FIXED-PARAMETER TRACTABLE ALGORITHMS; MATRIX MULTIPLICATION ALGORITHM; MINIMUM DEGREE; TECHNICAL LEMMAS; UNDIRECTED GRAPH;

ALGORITHMS; PARAMETER ESTIMATION;

GRAPH THEORY;

EID: 84878634597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_22     Document Type: Conference Paper

References (13)

1. 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.
2. 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. (Pubitemid 33322405)
3. N. Bansal and V. Raman, 'Upper Bounds for MAX-SAT further improved, Lecture Notes in Computer Science 1741 (1999) 247-258.
4. 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.
5. A Becker, R. Bar-Yehuda and D. Geiger, 'Random Algorithms for the Loop Cutset Problem', Journal of Artificial Intelligence Research 12 (2000) 219-234.
6. J. Chen, I. A. Kanj and W. Jia, 'Vertex Cover, Further Observations and Further Improvements', Lecture Notes in Computer Science 1665 (1999) 313-324.
7. 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. (Pubitemid 33371157)
8. R. Downey and M. R. Fellows, 'Parameterized Complexity', Springer Verlag 1998.
9. P. Erdos and L. Posa, 'On the maximal number of disjoint circuits of a graph', Publ Math. Debrecen 9 (1962) 3-12.
10. A. Itai and M. Rodeh, "Finding a minimum circuit in a graph", SIAM Journal on Computing, 7 (1978) 413-423.
11. 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.
12. R. Niedermeier and P. Rossmanith, 'New Upper Bounds for Maximum Satisfiability', Journal of Algorithms 36 (2000) 63-68.
13. V. Raman, 'Parameterized Complexity,' in Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India (1997), 1-18.