The minimum spanning strong subdigraph problem is fixed parameter tractable

Discrete Applied Mathematics

Volumn 156, Issue 15, 2008, Pages 2924-2929

  Bang Jensen, Jørgen ^a   Yeo, Anders ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

FTP algorithm; Minimum strong spanning subdigraph; Polynomial algorithm

Indexed keywords

DIRECTED PATH; FTP ALGORITHM; MINIMUM STRONG SPANNING SUBDIGRAPH; POLYNOMIAL ALGORITHM; POSITIVE INTEGERS;

EID: 53049101060     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.12.003     Document Type: Article

References (19)

1. Aho A.V., Garey M.R., and Ullman J.D. The transitive reduction of a directed graph. Siam J. Comput. 1 2 (1972) 131-137
2. Bang-Jensen J. Edge-disjoint in- and out-branchings in tournaments and related path problems. J. Combin. Theory Ser. B 51 (1991) 1-23
3. Bang-Jensen J., and Gutin G. Digraphs: Theory, Algorithms and Applications (2000), Springer-Verlag, London
4. Bang-Jensen J., Huang J., and Yeo A. Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs. SIAM J. Discrete Math. 16 (2003) 335-343
5. Bang-Jensen J., and Yeo A. The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs. J. Algorithms 41 (2001) 1-19
6. Bessy S., and Thomassé S. Every strong digraph has a spanning strong subgraph with at most n + 2 α - 2 arcs. J. Combin. Theory Ser. B 87 (2003) 289-299
7. E. Demaine, G. Gutin, D. Marx, U. Stege, Open problems from Dagstuhl Seminar 07281. See: http://erikdemaine.org/papers/DagstuhlFPT2007Open/paper.pdf
8. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag, New York
9. Estivill-Castro V., Fellows M.R., Langston M.A., and Rosamond F.A. FPT is P-Time extremal structure I. In: Broersma H., Johnson M., and Szeider S. (Eds). Algorithms and Complexity in Durham 2005, Proceedings of the First ACiD Workshop. Texts in Algorithmics vol. 4 (2005), King's College Publications 1-41
10. Gibbons P., Karp R., Ramachandran V., Soroker D., and Tarjan R. Transitive compaction in parallel via branchings. J. Algorithms 12 (1991) 110-125
11. Hsu H.T. An algorithm for finding a minimal equivalent graph of a digraph. J. Assoc. Comput. Machinery 22 (1975) 11-16
12. H. Fernau, Parameterized Algorithmics: A Graph-theoretic Approach, Habilitation Thesis, U. Tübingen, 2005
13. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
14. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. ACM SIGACT News 38 (2007) 31-45
15. Khuller S., Raghavachari B., and Young N. Approximating the minimum equivalent digraph. SIAM J. Comput. 24 (1995) 859-872
16. Khuller S., Raghavachari B., and Young N. On strongly connected digraphs with bounded cycle length. Discrete. Appl. Math. 69 (1996) 281-289
17. Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications (2006), Oxford University Press
18. Simon K. Finding a minimal transitive reduction in a strongly connected digraph within linear time. Graph Theoretic Concepts in Computer Science (Kerkrade, 1989) (1990), Springer-Verlag, Berlin 244-259
19. A. Vetta, Approximating the minimum strongly connected subgraph via a matching lower bound, in: SODA, 2001, pp. 417-426