Parameterized algorithms for feedback set problems and their duals in tournaments

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 446-458

  Raman, Venkatesh ^a   Saurabh, Saket ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Feedback arc set; Feedback vertex set; Parameterized complexity; Tournaments

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FEEDBACK; GRAPH THEORY; OPTIMIZATION; SET THEORY;

FEEDBACK ARC SET; FEEDBACK VERTEX SET; PARAMETERIZED COMPLEXITY; TOURNAMENTS;

PROBLEM SOLVING;

EID: 32144455763     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.010     Document Type: Conference Paper

References (19)

1. J. Bang-Jensen, and G. Gutin Digraphs Theory, Algorithms and Applications 2001 Springer Berlin
2. J.C. Bermond, A. Germa, M.C. Heydemann, and D. Sotteau Girth in digraphs J. Graph Theory 4 3 1980 337 341
3. L. Cai, and D. Juedes On the existence of subexponential parameterized algorithms J. Computer System Sci. 67 4 2003 789 807
4. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation revisited, manuscript available at: .
5. G. Even, J. (Seffi) Naor, B. Schieber, and M. Sudan Approximating minimum feedback sets and multicuts in directed graphs Algorithmica 20 1998 151 174
6. M. Fellows, M. Hallett, C. Korostensky, and U. Stege Analogs and duals of the MAST problem for sequences and trees J. Algorithms 49 1 2003 192 216
7. T. Gallai, On directed paths and circuits, in: P. Erdos, G. Katona (Eds.), Theory of Graphs, Proceedings Colloquium Tihnay, 1968, pp. 115-118.
8. E. Ya, Grinberg, and Ya.Ya. Dambit Nekotorye Svoistva Grafov Soderzhashchikh Kontury Latviiskii Mathematicheskii Ezhegodnile 2 1966 65 70 (Russian: Some Properties of Directed Graphs With Circuits)
9. A. Itai, and M. Rodeh Finding a minimum circuit in a graph SIAM J. Comput. 7 4 1978 413 423
10. S. Khot, and V. Raman Parameterized complexity of finding subgraphs with hereditary properties Theoret. Comput. Sci. 289 2002 997 1008
11. M. Mahajan, and V. Raman Parameterizing above guaranteed values: MaxSat and MaxCut J. Algorithms 31 1999 335 354
12. R. Niedermeier, and P. Rossmanith An efficient fixed parameter algorithm for 3-hitting set J. Discrete Algorithms 1 1 2003 89 102
13. S. Poljak, and D. Turzik A polynomial algorithm for constructing a large bipartite aubgraph, with an application to a satisfiability problem Canad. J. Math 34 3 1982 519 524
14. V. Raman, S. Saurabh, Parameterized complexity of directed feedback set problems in tournaments', in: Proc. Workshop on Data Structures and Algorithms (WADS 2003), Lecture Notes in Computer Science, Vol. 2748, Springer, Berlin, 2003, pp. 484-492.
15. V. Raman, S. Saurabh, Improved parameterized algorithms for feedback set problems in weighted tournaments, in: Proc. Internat. Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science, Vol. 3162, Springer, Berlin, 2004, pp. 260-270.
16. V. Raman, S. Saurabh, C.R. Subramanian, Faster fixed parameter tractable algorithms for undirected feedback vertex set, in: Proc. 13th Internat. Symp. on Algorithms and Computation (ISAAC 2002), Lecture Notes in Computer Science, Vol. 2518, Springer, Berlin, 2002, pp. 241-248.
17. V. Raman, S. Saurabh, and C.R. Subramanian Faster algorithms for feedback vertex set, in: Proc. Second Brazilian Symp. on Graphs, Algorithms and Combinatorics (GRACO 2005) Electronic Notes in Discrete Mathematics 19 2005 273 279
18. E. Speckenmeyer, On feedback problems in digraphs, in: Proc. 15th Internat. Workshop WG'89, Lecture Notes in Computer Science, Vol. 411, Springer, Berlin, 1989, pp. 218-231.
19. N. Alon, Ranking tournaments. SIAM Journal of Discrete Mathematics, to appear.