Improved parameterized algorithms for feedback set problems in weighted tournaments

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

Volumn 3162, Issue , 2004, Pages 260-270

  Raman, Venkatesh ^a   Saurabh, Saket ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

FEEDBACK ARC SETS; FEEDBACK SET PROBLEM; FEEDBACK VERTEX SET PROBLEMS; FIXED-PARAMETER COMPLEXITY; MATRIX MULTIPLICATION ALGORITHM; PARAMETERIZED ALGORITHM; POSITIVE INTEGERS; WEIGHTED FEEDBACK VERTEX SETS;

PARAMETER ESTIMATION;

EID: 35048888464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_23     Document Type: Article

References (12)

1. J. Bang-Jensen and G. Gutin, 'Digraphs Theory, Algorithms and Applications', Springer Verlag 2001.
2. J. C. Bermond, A. Germa, M. C.Heydemann and D. Sotteau, 'Girth in Digraphs', Journal of Graph theory, 4 (3) (1980) 337-341.
3. L. Cai and D. Juedes, 'On the Existence of Subexponential Parameterized Algorithms', Journal of Computer and System Sciences 67 (4) (2003) 789-807.
4. R. Downey and M. R. Fellows, 'Parameterized Complexity', Springer Verlag 1998.
5. C. Dwork, R. Kumar, M. Naor and D. Sivakumar, 'Rank Aggregation Revisited', WWW10; selected as Web Search Area highlight, 2001.
6. M. Fellows, M. Hallett, C. Korostensky, U. Stege, 'Analogs and Duals of the MAST Problem for Sequences and Trees', in Proceedings of 6th Annual European Symposium on Algorithms (ESA '98), Venice, Lecture Notes in Computer Science 1461 (1998) 103-114.
7. A. Itai and M. Rodeh, 'Finding a Minimum Circuit in a Graph', Siam Journal of Computing 7 (4) (1978) 413-423.
8. D. A. Narayan, 'The Reversing Number of a Digraph; A Disjoint Union of Directed Stars', Congressus Numerantium 145, (2000) 53-64.
9. R. Niedermeier and P. Rossmanith, 'An efficient Fixed Parameter Algorithm for 3-Hitting Set', Journal of Discrete Algorithms 2 (1) (2001).
10. V. Raman, S. Saurabh and C. R. Subramanian, 'Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set', in the Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002), Lecture Notes in Computer Science 2518 (2002) 241-248.
11. V. Raman and S. Saurabh, 'Parameterized Complexity of Directed Feedback Set Problems in Tournaments', in the Proceedings of Workshop on Data Structure and Algorithms (WADS 2003), Lecture Notes in Computer Science 2748 (2003) 484-492.
12. E. Speckenmeyer, 'On Feedback Problems in Digraphs', in Proceedings of the 15th International Workshop WG'89, Lecture Notes in Computer Science 411 (1989) 218-231.