Faster fixed parameter tractable algorithms for finding feedback vertex sets

ACM Transactions on Algorithms

Volumn 2, Issue 3, 2006, Pages 403-415

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

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Feedback vertex set; Girth; Parameterized complexity

Indexed keywords

FEEDBACK VERTEX SET; GIRTH; PARAMETERIZED COMPLEXITY;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

ALGORITHMS;

EID: 33748996754     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1159892.1159898     Document Type: Article

References (17)

1. ALBER, J., BODLAENDER, H. L., FERNAU, H., KLOKS, T., AND NIEDERMEIER, R. 2002. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 4, 461-493.
2. ALBER, J., FAN, H., FELLOWS, M. R., FERNAU, H., NIEDERMEIER, R., ROSAMOND, F. A., AND STEGE, U. 2001. Refined search tree technique for dominating set on planar graphs. In Proceedings of 26th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 2186. Springer-Verlag, New York, 111-122.
3. ALON, N., HORRAY, S., AND LINIAL, N. 2002. The moore bound for irregular graphs. Graphs Combinat. 18, 53-57.
4. BAR-YEHUDA, R., GEIGER, D., NAOR, J., AND ROTH, R. M. 1998. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference. SIAM J. Comput. 27, 4, 942-959.
5. BECKER, A., BAR-YEHUDA, R., AND GEIGER, D. 2000. Randomized algorithms for the loop cutset problem. J. Artif. Intel. Research 12, 219-234.
6. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill, New York.
7. 3) FPT algorithm for the undirected feedback vertex set problem. In Proceedings of 11th International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science, vol. 3595. Springer-Verlag, New York, 859-869.
8. DOWNEY, R., AND FELLOWS, M. 1999. Parameterized Complexity. Springer-Verlag, New York.
9. ERDÖS, P., AND POSA, L. 1962. On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9, 3-12.
10. ESTIVILL-CASTRO, V., FELLOWS, M. R., LANGSTON, M. A., AND ROSAMOND, F. A. 2006. The undirected feedback vertex set problem has a poly(k) kernel. In Proceedings of 2nd International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, Springer-Verlag, New York.
11. FOMIN, F. V., AND THILIKOS, D. M. 2003. Dominating sets in planar graphs: branch-width and exponential speed-up. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 168-177.
12. GUO, J., GRAMM, J., HÜFFNER, F., NIEDERMEIER, R., AND WERNICKE, S. 2005. Improved fixed-parameter algorithms for two feedback set problems. In Proceedings of 9th Workshop on Algorithms and Data Structures (WADS). Lecture Notes in Computer Science, vol. 3608. Springer-Verlag, New York, 158-168.
13. ITAI, A., AND RODEH, M. 1978. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 4, 413-423.
14. KANJ, I. A., PELSMAJER, M. J., AND SCHAEFER, M. 2004. Parameterized algorithms for feedback vertex set. In Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 3162. Springer-Verlag, New York, 235-247.
15. KANJ, I. A., AND PERKOVIC, L. 2002. Improved parameterized algorithms for planar dominating set. In Proceedings of 27th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 2420. Springer-Verlag, New York, 399-410.
16. RAMAN, V., SAURABH, S., AND SUBRAMANIAN, C. R. 2002. Faster fixed parameter tractable algorithms for undirected feedback vertex set. In Proceedings of 13th Annual International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 2518. Springer-Verlag, New York, 241-248.
17. RAMAN, V., SAURABH, S., AND SUBRAMANIAN, C. R. 2005. Faster algorithms for feedback vertex set. In Proceedings of 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO). Electronic Notes in Discrete Mathematics, vol. 19. 273-279.