A fixed-parameter algorithm for the directed feedback vertex set problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 177-186

  Chen, Jianer ^a   Liu, Yang ^a   Lu, Songjian ^a   O'Sullivan, Barry ^b   Razgon, Igor ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DIRECTED GRAPHS; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC TECHNIQUES; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; FIXED-PARAMETER ALGORITHMS; PARAMETERIZED; PARAMETERIZED COMPUTATION; RUNNING TIME;

PARAMETER ESTIMATION;

EID: 57049178481     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374404     Document Type: Conference Paper

References (30)

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. H. BODLAENDER, On linear time minor tests and depth-first search, Proc. 1st Workshop on Algorithms and, Data Structures (WADS'89), (1989), pp. 577-590.
3. H. BODLAENDER., A Cubic Kernel for Feedback Vertex Set, Proc. STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, 2007, pp. 320-331.
4. J. CHEN, F. FOMIN, Y. LIU, S. LU, AND Y. VLLLANGER, Improved algorithms for the feedback vertex set problems, Proc. 10th Workshop on Algorithms and Data Structures, (WADS'07), Lecture Notes in Computer Science 4619, (2007), pp. 422-433.
5. J. CHEN, I. KANJ, AND W. JIA, Vertex cover: further observations and further improvements, Journal of Algorithms 41, (2001), pp. 280-301.
6. J. CHEN, Y. LIU, AND S. LU, An improved parameterized algorithm for the minimum node multiway cut problem, Proc. 10th Workshop on Algorithms and Data Structures, (WADS'07), Lecture Notes in Computer Science 4619, (2007), pp. 495-506.
7. 3) fpt algorithm for the undirected feedback vertex set problem, Proc. 11th International Computing and Combinatorics Conference (COCOON'05), Lecture Notes in Computer Science 3595, (2005), pp. 859-869.
8. M. DOM, J. GUO, F. HÜFFNER, R. NIEDERMEIER, AND A. TRUSS, Fixed-parameter tractability results for feedback set problems in tournaments, Proc. 6th Conference on Algorithms and Complexity (CIAC'06), Lecture Notes in Computer Science 3998, (2006), pp. 320-331.
9. R. DOWNEY AND M. FELLOWS, Fixed parameter intractability, Proc. 7th Annual Structural Complexity Conference, (1992), pp. 36-49.
10. R. DOWNEY AND M. FELLOWS, Fixed-parameter tractability and completeness I: Basic Results, SIAM J. Comput. 24, (1995), pp. 873-921.
11. R. DOWNEY AND M. FELLOWS, Fixed-parameter tractability and completeness II: on completeness for W[1], Theoret. Computer Sci. 141, (1995), pp. 109-131.
12. R. DOWNEY AND M. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
13. G. EVEN, J. NAOR, B. SCHIEBER, AND M. SUDAN, Approximating minimum feedback sets and multicuts in directed graphs, Algoritkmica 20, (1998), pp. 151-174.
14. G. GARDARIN AND S. SPACCAPIETRA, Integrity of databases: a general lockout algorithm with deadlock avoidance, in Modeling in Data Base Management System, G. NIJSSSEN, ed., North-Holland, Amsterdam, (1976), pp. 395-411.
15. M. GAREY AND 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, Compression-based 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. HÜFFNER, R. NIEDERMEIER., AND S. WERNICKE, improved fixed-parameter algorithms for two feeback set problems, Proc. 9th Workshop on Algorithms and Data Structures (WADS'05), Lecture Notes in Computer Science 3608, (2005), pp. 158-168.
18. G. GUTIN AND A. YEO, Some parameterized problems on digraphs, The Computer Journal, to appear.
19. F. HÜFFNER, R. NIEDERMEIER, S. WERNICKE, Techniques for Practical Fixed-Parameter Algorithms, The Computer Journal, 51(1), 2008, pp. 7-25.
20. I. KANJ, M. PELSMAJER, AND M. SCHAEFER, Parameterized algorithms for feedback vertex set, Proc. 1st International Workshop on Parameterized and Exact Computation (IWPEC'04), Lecture Notes in Computer Science 3162, (2004), pp. 235-247.
21. R. KARP Reducibility among combinatorial problems. in Complexity of Computer Computations, R. MILLER AND J. THATCHER, eds., Plenum Press, New York, pp. 85-103.
22. T. LEIGHTON AND S. RAO, An approximation max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms, Proc. 29th IEEE Symp. on Foundations of Computer Science (FOCS'88), (1988), pp. 422-431.
23. C. LEISERSON AND J. SAXE, Retiming synchronous circuitry, Algorithmica 6, (1991), pp. 5-35.
24. O. LICHTENSTEIN AND A. PNUELI, Checking that finite state concurrent programs satisfy their linear-specification. Proc. 12th ACM Symp. Principles of Prog. Languages, (1985), pp. 97-107.
25. R. NIEDERMEIER., Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications, volume 31, 2006.
26. 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.
27. V. RAMAN AND S. SAURABH, Parameterized complexity of directed feedback set problems in tournaments, Proc. 8th Workshop on Algorithms and Data Structures (WADS'03), Lecture Notes in Computer Science 2748, (2003), pp. 484-492.
28. V. RAMAN AND S. SAURABH, Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science 351, (2006), pp. 446-458.
29. B. REED, K. SMITH, AND A. VETTA, Finding odd cycle transversals, Oper. Res. Lett. 32, (2004), pp. 299-301.
30. A. SILBERSCHATZ AND P. GALVIN, Operating System Concepts, 4th ed., Addison Wesley, Reading, MA, 1994.