Finding Edge-disjoint paths in partial k-trees

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

Volumn 1178, Issue , 1996, Pages 203-212

  Zhou, Xiao ^a   Tamura, Syurei ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

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

Indexed keywords

FORESTRY; POLYNOMIAL APPROXIMATION;

EDGE COLORING; EDGE DISJOINT PATHS; PARTIAL K-TREES; POLYNOMIAL-TIME ALGORITHMS; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 84990189335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009496     Document Type: Conference Paper

References (30)

1. 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. 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. 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. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. of the 25th Ann. A CM Syrup. on Theory of Computing, pp. 226-234, San Diego, CA, 1993.
5. 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, Vol. 7, pp. 555-581, 1992.
6. 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. A. Frank. Disjoint paths in rectilinear grids. Combinatorica, Vol. 2, No. 4, pp. 361-371, 1982.
8. M. Kaufmann and K. Mehlhorn. Routing through a generalized switchbox. J. Algorithms, Vol. 7, pp. 510-531, 1986.
9. J. Lagergren. Private communication, May 2, 1996.
10. K. Matsumoto, T. Nishizeki, and N. Saito. An efficient algorithm for finding multicommodity flows in planar networks. SIAM J. Comput., Vol. 14, No. 2, pp. 289-302, 1985.
11. K. Matshmoto, T. Nishizeki, and N. Saito. Planar multicommodity flows, maximum matchings and negative cycles. SIAM J. Comput., Vol. 15, No. 2, pp. 495-510, 1986.
12. K. Mehlhorn and F.P. Preparata. Routing through a rectangle. J. A CM, Vol. 33, No. 1, pp. 60-85, 1986.
13. M. Middendorf. Private communication, May 1996.
14. M. Middendorf and F. Pfeiffer. On the complexity of disjoint paths problem. Combinatorica, Vol. 13, No. 1, pp. 97-107, 1993.
15. T. Nishizeki, N. Saito, and K. Suzuki. A linear-time routing algorithm for convex grids. IEEE Trans. Comput.-Aided Design, Vol. 4, No. 1, pp. 68-76, 1985.
16. N. Robertson and P.D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, Vol. 7, pp. 309-322, 1986.
17. N. Robertson and P.D. Seymour. Graph minors. XIII. The disjoint paths problem. J. of Combin. Theory, Series B, Vol. 63, No. 1, pp. 65-110, 1995.
18. H. Suzuki, T. Akama, and T. Nishizeki. Finding Steiner forests in planar graphs. In Proc. of the First Ann. A CM-SIAM Sympo. on Discrete Algorithms, pp. 444-453, 1990.
19. P. Scheffier. 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. A. Sebö. Integer plane multiflows with a fixed number of demands. J. of Combin. Theory, Series B, Vol. 59, pp. 163-171, 1993.
21. 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. H. Suzuki, T. Nishizeki, and N. SMto. Algorithms for multicommodity flows in planar graphs. Algorithmica, Vol. 4, pp. 471-501, 1989.
23. K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. Journal of A CM, Vol. 29, No. 3, pp. 623-641, 1982.
24. J.A. Telle, and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination like problems. Proc. of Workshop on Algorithms and Data Structures, WADS'93, Montreal, Lect. Notes on Computer Science, Springer-Verlag, 709, pp. 610-621, 1993.
25. J. Vygen. NP-completeness of some edge-disjoint paths problems. Discrete Appl. Math., Vol. 61, pp. 83-90, 1995.
26. D. Wagner and K. Weihe. A linear-time algorithm for edge-disjoint paths in planar graphs. Proc. of the First Europ. Syrup. on Algorithms (ESA'93), Lect. Notes in Computer Science, Springer-Verlag, 726, pp. 384-395, 1992.
27. X. Zhou and T. Nishizeki. Optimal parallel algorithms for edge-coloring partiM k-trees with bounded degrees. IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, Vol. E78-A, pp. 463-469, 1995.
28. X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial k-trees. Journal of Algorithms, to appear.
29. 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.
30. X. Zhou, S. Tamura, and T. Nishizeki. Finding edge-disjoint paths in partial k-trees. Tech. Rept. 96-1, Dept. of Inf. Eng., Tohoku Univ., Sept. 1996.