Finding edge-disjoint paths in partial k-trees

Algorithmica (New York)

Volumn 26, Issue 1, 2000, Pages 3-30

  Zhou, X ^a   Tamura, S ^a   Nishizeki, T ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Bounded treewidth; Edge coloring; Edge disjoint paths; Partial k tree; Polynomial time algorithm

Indexed keywords

EID: 0002834073     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910002     Document Type: Article

References (31)

1. [ACPS] S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Journal of the Association for Computing Machinery, Vol. 40, No. 5, pp. 1134-1164, 1993.
2. [ALS] S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, Vol. 12, No. 2, pp. 308-340, 1991.
3. [B1] H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, Vol. 11, No. 4, pp. 631-643, 1990.
4. [B2] H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, Vol. 25, pp. 1305-1317, 1996.
5. [BPT] R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, Vol. 7, pp. 555-581, 1992.
6. [C] B. Courcelle. The monadic second-order logic of graphs, I: Recognizable sets of finite graphs. Information and Computation, Vol. 85, pp. 12-75, 1990.
7. [F] A. Frank. Disjoint paths in rectilinear grids. Combinatorica, Vol. 2, No. 4, pp. 361-371, 1982.
8. [KM] M. Kaufmann and K. Mehlhorn. Routing through a generalized switchbox. Journal of Algorithms, Vol. 7, pp. 510-531, 1986.
9. [L] J. Lagergren. Private communication, May 2, 1996.
10. [MNS1] K. Matsumoto, T. Nishizeki, and N. Saito. An efficient algorithm for finding multicommodity flows in planar networks. SIAM Journal on Computing, Vol. 14, No. 2, pp. 289-302, 1985.
11. [MNS2] K. Matshmoto, T. Nishizeki, and N. Saito. Planar multicommodity flows, maximum matchings and negative cycles. SIAM Journal on Computing, Vol. 15, No. 2, pp. 495-510, 1986.
12. [MP1] K. Mehlhorn and F. P. Preparata. Routing through a rectangle. Journal of the Association for Computing Machinery, Vol. 33, No. 1, pp. 60-85, 1986.
13. [M] M. Middendorf. Private communication, May 1996.
14. [MP2] M. Middendorf and F. Pfeiffer. On the complexity of disjoint paths problem. Combinatorica, Vol. 13, No. 1, pp. 97-107, 1993.
15. [NSS] T. Nishizeki, N. Saito, and K. Suzuki. A linear-time routing algorithm for convex grids. IEEE Transactions on Computer-Aided Design, Vol. 4, No. 1, pp. 68-76, 1985.
16. [RS1] N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, Vol. 7, pp. 309-322, 1986.
17. [RS2] N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B, Vol. 63, No. 1, pp. 65-110, 1995.
18. [SAN] H. Suzuki, T. Akama, and T. Nishizeki. Finding Steiner forests in planar graphs. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 444-453, 1990.
19. [S1] P. Scheffler. A practial linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical Report 396, Dept. of Mathematics, Technische Universität Berlin, 1994.
20. [S2] A. Sebö. Integer plane multiflows with a fixed number of demands. Journal of Combinatorial Theory, Series B, Vol. 59, pp. 163-171, 1993.
21. [SIN] H. Suzuki, A. Ishiguro, and T. Nishizeki. Edge-disjoint paths in a grid bounded by two nested rectangles. Discrete Applied Mathematics, Vol. 27, pp. 157-178, 1990.
22. [SNS] H. Suzuki, T. Nishizeki, and N. Saito. Algorithms for multicommodity flows in planar graphs. Algorithmica, Vol. 4, pp. 471-501, 1989.
23. [TNS] K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. Journal of the Association for Computing Machinery, Vol. 29, No. 3, pp. 623-641, 1982.
24. [TP] J.A. Telle, and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination like problems. Proceedings of the Workshop on Algorithms and Data Structures, WADS '93, Montreal, Lecture Notes in Computer Science, Vol. 709, Springer-Verlag, Berlin, pp. 610-621, 1993.
25. [V] J. Vygen. NP-completeness of some edge-disjoint paths problems. Discrete Applied Mathematics, Vol. 61, pp. 83-90, 1995.
26. [WW] D. Wagner and K. Weihe. A linear-time algorithm for edge-disjoint paths in planar graphs. Proceedings of the First European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science, Vol. 726, Springer-Verlag, Berlin, pp. 384-395, 1992.
27. [ZN1] X. Zhou and T. Nishizeki. Optimal parallel algorithms for edge-coloring partial k-trees with bounded degrees. IEICE Transactions on Fundamentals of Electronics, Communication and Computer Sciences, Vol. E78-A, pp. 463-469, 1995.
28. [ZN2] X. Zhou and T. Nishizeki. The edge-disjoint paths problem is NP-complete for partial k-trees. Proceedings of ISAAC '98, Lecture Notes in Computer Science, Springer-Verlag, 1533, pp. 417-426, 1998.
29. [ZNN] X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial k-trees. Journal of Algorithms, Vol. 21, pp. 598-617, 1996.
30. [ZSN] X. Zhou, H. Suzuki, and T. Nishizeki. A linear algorithm for edge-coloring series-parallel multigraphs. Journal of Algorithms, Vol. 20, pp. 174-201, 1996.
31. [ZTN] X. Zhou, S. Tamura, and T. Nishizeki. Finding edge-disjoint paths in partial k-trees. In Proceedings of the Seventh International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1178, Springer-Verlag, Berlin, pp. 203-212, 1996.