FPT algorithms for path-transversals and cycle-transversals problems in graphs

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

Volumn 5018 LNCS, Issue , 2008, Pages 129-140

  Guillemot, Sylvain ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY;

CYCLE-TRANSVERSALS; GROUP-LABELLED GRAPHS; SEPARATION PROBLEMS;

PROBLEM SOLVING;

EID: 44649133396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_13     Document Type: Conference Paper

References (9)

1. Chen, J., Liu, Y., Lu, S.: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 495-506. Springer, Heidelberg (2007)
2. Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L.A., Lohman, M., Seymour, P.D.: Packing Non-Zero A-Paths In Group-Labelled Graphs. Combinatorica 5(26), 521-532 (2006)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
4. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
5. Garg, N., Vazirani, V., Yannakakis, M.: Multiway Cuts in Directed and Node Weighted Graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 487-498. Springer, Heidelberg (1994)
6. Gupta, A., Talwar, K.: Approximating unique games. In: Proc. SODA 2006, pp. 99-106 (2006)
7. Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. STOC 2002, pp. 767-775 (2002)
8. Marx, D.: Parameterized graph separation problems. Theoretical Computer Science (351), 394-406 (2006)
9. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299-301 (2004)