Directed Feedback Vertex Set Problem is FPT

Dagstuhl Seminar Proceedings

Volumn 7281, Issue , 2007, Pages

  Chen, Jianer ^a   Liu, Yang ^a   Lu, Songjian ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

directed feedback vertex set problem; fixed parameter tractability; network flow; parameterized algorithm

Indexed keywords

PARAMETER ESTIMATION; PARAMETERIZATION;

DIRECTED FEEDBACK VERTEX SET PROBLEM; FEEDBACK ARC SETS; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; FIXED-PARAMETER TRACTABILITY; FPT ALGORITHMS; NETWORKS FLOWS; PARAMETERIZED; PARAMETERIZED ALGORITHM; SET PROBLEMS;

DIRECTED GRAPHS;

EID: 84864179085     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. V. Bafna, P. Berman, and T. Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math., 12(1999), pp.289-297.
2. A. Becker, R. Bar-Yehuda, and D. Geiger. Randomized algorithms for the loop cutset problem. J. Artificial Intelligence Res., 12(2000), pp.219-234.
3. H. Bodlaender. On disjoint cycles. Int. J. Found. Comput. Sci., 5(1994), pp.59-68.
4. G. Chartrand and L. Lesniak. Graphs & Digraphs. The Wadsworth & Brooks/Cole Mathematics Series, (Second edition), 1986.
5. J. Chen, F. Fomin, Y. Liu, S. Lu, and Y. Villanger. Improved Algorithms for the Feedback Vertex Set Problems. WADS (2007) to appear.
6. F. Dehne, M. Fellows, M. Langston, F. Rosamond, and K. Stevens. An O(2O(k)n3) fpt algorithm for the undirected feedback vertex set problem. CO- COON, volume 3595 of Lecture Notes in Computer Science, (2005), pp.859-869.
7. M. Dom, J. Guo, F. uffner, R. Niedermeier, and A. Tru. Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. Proc. 6th CIAC-06, volume 3998 of Lecture Notes in Computer Science, (2006), pp.320-331.
8. R. Downey and M. Fellows. Fixed Parameter Tractability and Completeness. Com- plexity Theory: Current Research, Cambridge University Press, (1992), pp.191-225.
9. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
10. R. Downey, M. Fellows. Fixed-Parameter Tractability and Completeness I: Basic Results Theoretical Computer Science, (1995).
11. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(1998), pp.151-174.
12. H. Fernau. A top-down approach to search-trees: Improved algorithmics for 3- hitting set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity, 2004.
13. F. Fomin, S. Gaspers, and A. Pyatkin. Finding a minimum feedback vertex set in time O(1.7548n). IWPEC, volume 4169 of Lecture Notes in Computer Science, (2006), pp.184-191.
14. G. Gardarin, and S. Spaccapietra. Integrity of Databases: A General Lockout Algorithm with Deadlock Avoidance. In Modeling in Data Base Management System, G. M. Nijsssen, ed., North-Holland, Amsterdam, (1976), pp.395-411.
15. M. Garey, D. Johnson. Computers and Intractability: A guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
16. J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke. Compressionbased fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci., 72(2006), pp.1386-1396.
17. J. Guo, J. Gramm, F. Huffner, R. Niedermeier, and S. Wernicke. Improved fixedparameter algorithms for two feeback set problems. WADS, volume 3608 of Lecture Notes in Computer Science, (2004), pp.158-168.
18. G. Gutin, and A. Yeoy. Some Parameterized Problems on Digraphs, (Survey)
19. I. Kanj, M. Pelsmajer, and M. Schaefer. Parameterized algorithms for feedback vertex set. IWPEC, volume 3162 of Lecture Notes in Computer Science, (2004), pp.235-247.
20. R. Karp. Reducibility among combinatorial problems. in R. Miller and J. Thatcher(eds.), Complexity of Computer Compuattions, Plenum Press, New York, pp.85-103.
21. V. Raman, S. Saurabh, and C. Subramanian. Faster fixed parameter tractable algorithms for undirected feedback vertex set. ISAAC 2002, volume 2518 of Lecture Notes in Computer Science, (2002), pp.241-248.
22. V. Raman, S. Saurabh, and C. Subramanian. Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms, 2(2006), pp.403-415.
23. V. Raman and S. Saurabh. Parameterized complexity of directed feedback set problems in tournaments. WADS, volume 2748 of Lecture Notes in Computer Science, (2003), pp.484-492.
24. V. Raman and S. Saurabh. Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science, 351(2006), pp.446-458.
25. V. Raman, S. Saurabh, and C. Subramanian. Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets. ACM Transactions on Algorithms, (2006)2, pp.403-415.
26. I. Razgon. Exact computation of maximum induced forest. SWAT, volume 4059 of Lecture Notes in Computer Science, (2006), pp.160-171.
27. A. Silberschatz and P. Galvin. Operating System Concepts, 4th edition. In complexity of Computer Computations, pp. 85-104, Plenum Press, N.Y., 1972.
28. E. Speckenmeyer. On feedback problems in digraphs. WG volume 411 of Lecture Notes in Computer Science, (1989), pp.218-231.