The edge-disjoint paths problem is np-complete for partial k-trees

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

Volumn 1533 LNCS, Issue , 1998, Pages 417-426

  Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

COMBINATORIAL PROBLEM; EDGE DISJOINT PATHS; GENERAL GRAPH; LINEAR TIME; NP COMPLETE; PARTIAL K-TREES; POLYNOMIAL-TIME; SUBGRAPH ISOMORPHISM PROBLEM;

GRAPH THEORY;

EID: 84867453493     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_44     Document Type: Conference Paper

References (27)

1. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Journal of the Association for Computing Machinery, 40(5):1134-1164, 1993.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, 1991.
3. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305-1317, 1996.
4. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555-581, 1992.
5. S.A. Cook. The complexity of theorem-proving procedures. In Proc. of 3th Symp. Theory of Comp. Association for Computing Machinery, pages 151-158, 1971.
6. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
7. A. Dessmark, A. Lingas, and A. Proskurowski. Faster algorithms for subgraph isomorphism of k-connected partial k-trees. In Proc. of the Fourth Europian Symposium on Algorithms, Lect. Notes in Computer Science, Springer-Verlag, volume 1136, pages 501-513, 1996.
8. A. Frank. Edge-disjoint paths in planar graphs. Journal of Combinatorial Theory, Series B, 39:164-178, 1985.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York, 1979.
10. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science, 164:287-297, 1996.
11. N. Garg, V.V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997.
12. J. Kleinberg and E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. In Proc. ACM Symp. Theory of Computing, pages 26-35, 1995.
13. K. Matsumoto, T. Nishizeki, and N. Saito. An efficient algorithm for finding multicommodity flows in planar networks. SIAM J. Comput., 14(2):289-302, 1985.
14. M. Middendorf and F. Pfeiffer. On the complexity of disjoint paths problem. Combinatorica, 13(1):97-107, 1993.
15. J. Matousek and R. Thomas. On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics, 108:343-364, 1992.
16. N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
17. N. Robertson and P.D. Seymour. Graph minors XIII. The disjoint paths problem. J. of Combin. Theory, Series B, 63(1):65-110, 1995.
18. H. Ripphausen-Lipa, D. Wagner, and K. Weihe. Efficient algorithms for disjoint paths in planar graphs. DIM ACS Series in Discrete Math. and Theoretical Computer Science, 20:295-354, 1995.
19. P. Scheffler. A practial linear time algorithm for disjoint paths in graphs with bound tree-width. Technical Report 396, Dept. Mathematics, Technische Universität Berlin, 1994.
20. M. Syslo. NP-complete problems on some tree-structured graphs: a review. In Proc. WG'83 International Workshop on Graph Theoretic Concepts in Computer Science, pages 478-489, Univ. Verlag Rudolf Trauner, Linz, West Germany, 1983.
21. H. Suzuki, A. Ishiguro, and T. Nishizeki. Edge-disjoint paths in a grid bounded by two nested rectangles. Discrete Applied Mathematics, 27:157-178, 1990.
22. H. Suzuki, T. Nishizeki, and N. Saito. Algorithms for multicommodity flows in planar graphs. Algorithmica, 4:471-501, 1989.
23. J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math., 10:529-550, 1997.
24. J. Vygen. NP-completeness of some edge-disjoint paths problems. Discrete Appl. Math., 61:83-90, 1995.
25. D. Wagner and K. Weihe. A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica., 15:135-150, 1995.
26. X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial k-trees. Journal of Algorithms, 21:598-617, 1996.
27. X. Zhou, S. Tamura, and T. Nishizeki. Finding edge-disjoint paths in partial k-trees. In Proc. of the Seventh International Symposium on Algorithms and Computation, Lect. Notes in Computer Science, Springer-Verlag, volume 1178, pages 203-212, 1996.