The induced disjoint paths problem

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

Volumn 5035 LNCS, Issue , 2008, Pages 47-61

  Kawarabayashi, Ken Ichi ^a   Kobayashi, Yusuke ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MICROFLUIDICS; NONLINEAR PROGRAMMING; OPTIMIZATION;

DISJOINT PATHS PROBLEM; GRAPH G; INTERNATIONAL CONFERENCES; VERTEX PAIRS;

INTEGER PROGRAMMING;

EID: 45749108671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_4     Document Type: Conference Paper

References (26)

1. Bienstock, D.: On the complexity of testing for even holes and induced odd paths. Discrete Math. 90, 85-92 (1991)
2. Chudnovsky, M., Cornuéjols, G., Liu, X., Seymour, P.D., Vuskovic, K.: Recognizing Berge graphs. Combinatorica 25, 143-186 (2005)
3. Chudnovsky, M., Kawarabayashi, K., Seymour, P.D.: Detecting even holes. J. Graph Theory 48, 85-111 (2005)
4. Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect theorem. Annals of Mathematics 64, 51-219 (2006)
5. Cornuéjols, G., Conforti, M., Kapoor, A., Vusksvic, K.: Even-hole-free graphs I. Decomposition theorem. J. Graph Theory 39, 6-49 (2002)
6. Cornuéjols, G., Conforti, M., Kapoor, A., Vusksvic, K.: Even-hole-free graphs. II. Recognition algorithm. J. Graph Theory 40, 238-266 (2002)
7. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5, 691-703 (1976)
8. Fellows, M.R.: The Robertson-Seymour Theorems: a survey of applications. In: Comtemporary Mathematics, vol. 89, pp. 1-18. American Mathematical Society (1987)
9. Fellows, M.R., Kratochvil, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13, 266-282 (1995)
10. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10, 111-121 (1980)
11. Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45-68 (1975)
12. Kawarabayashi, K., Kobayashi, Y.: A linear time algorithm for the induced disjoint paths problem in planar graphs (manuscript)
13. Kobayashi, Y.: An extension of the disjoint paths problem, METR 2007-14, Department of Mathematical Informatics, University of Tokyo (2006)
14. Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. SIGDA Newsletter 5(3), 31-36 (1975)
15. Mohar, B., Thomassen, C.: Graphs on Surfaces. The Johns Hopkins University Press, Baltimore, London (2001)
16. Reed, B.: Rooted routing in the plane. Discrete Applied Math. 57, 213-227 (1995)
17. Reed, B.A., Robertson, N., Schrijver, A., Seymour, P.D.: Finding disjoint trees in planar graphs in linear time. In: Contemporary Mathematics, vol. 147, pp. 295-301. American Mathematical Society (1993)
18. Robertson, N., Seymour, P.D.: Graph minors. VII. Disjoint paths on a surface. Journal of Combinatorial Theory Ser. B 45, 212-254 (1988)
19. Robertson, N., Seymour, P.D.: Graph minors. XI. Circuits on a surface. Journal of Combinatorial Theory Ser. B 60, 72-106 (1994)
20. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory Ser. B 63, 65-110 (1995)
21. Robertson, N., Seymour, P.D.: Graph minors. XXII. Irrelevant vertices in linkage problems (manuscript)
22. Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM Journal on Computing 23, 780-788 (1994)
23. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
24. Seymour, P.D.: Disjoint paths in graphs. Discrete Mathematics 29, 293-309 (1980)
25. Shiloach, Y.: A polynomial solution to the undirected two paths problem. Journal of the ACM 27, 445-456 (1980)
26. Thomassen, C.: 2-linked graphs. European Journal of Combinatorics 1, 371-378 (1980)