Parameterized graph separation problems

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 394-406

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Multicut; Multiway cut; Parameterized complexity; Separator

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; SEPARATORS;

MULTICUT; MULTIWAY CUT; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS;

PROBLEM SOLVING;

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

References (14)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice-Hall Englewood Cliffs, NJ
2. N. Alon, R. Yuster, and U. Zwick Finding and counting given length cycles Algorithmica 17 3 1997 209 223
3. T.N. Bui, and C. Jones Finding good approximate vertex and edge partitions is NP-hard Inform. Process. Lett. 42 3 1992 153 159
4. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, G. Xia, Tight lower bounds for certain parameterized NP-hard problems, in: Proc. 19th Ann. IEEE Conf. on Computational Complexity, 2004, pp. 150-160.
5. W.H. Cunningham, The optimal multiterminal cut problem, in: Reliability of Computer and Communication Networks (New Brunswick, NJ, 1989), Vol. 5, DIMACS Series in Discrete Mathematics Theoretical Computer Sciences, American Mathematical Society, Providence, RI, 1991, pp. 105-120.
6. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis The complexity of multiterminal cuts SIAM J. Comput. 23 4 1994 864 894
7. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto, and F. Rosamund Cutting up is hard to do J. Harland Electronic Notes in Theoretical Computer Science Vol. 78 2003 Elsevier Amsterdam
8. R.G. Downey, and M.R. Fellows Parameterized Complexity, Monographs in Computer Science 1999 Springer New York
9. N. Garg, V.V. Vazirani, and M. Yannakakis Primal-dual approximation algorithms for integral flow and multicut in trees Algorithmica 18 1 1997 3 20
10. N. Garg, V.V. Vazirani, and M. Yannakakis Multiway cuts in node weighted graphs J. Algorithms 50 1 2004 49 61
11. M. Grohe, and J. Flum Parameterized complexity and subexponential time Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 84 2004 71 100
12. R.J. Lipton, and R.E. Tarjan A separator theorem for planar graphs SIAM J. Appl. Math. 36 2 1979 177 189
13. R.J. Lipton, and R.E. Tarjan Applications of a planar separator theorem SIAM J. Comput. 9 3 1980 615 627
14. R. Niedermeier, Invitation to fixed-parameter algorithms, 2002, Habilitation Thesis, Universität Tübingen.