A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs

Journal of Algorithms

Volumn 20, Issue 1, 1996, Pages 174-201

  Zhou, Xiao ^a   Suzuki, Hitoshi ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CHROMATIC INDEX; GRAPH COLOURING; LINEAR TIME; MULTIGRAPH;

GRAPH THEORY;

EID: 0030360259     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0008     Document Type: Article

References (14)

1. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, J. Assoc. Comput. Mach. 40, No. 5 (1993), 1134-1164.
2. S. Arnborg and J. Lagergren, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340.
3. H. L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms 11 (1990), 631-643.
4. 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 7 (1992), 555-581.
5. B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput. 85 (1990), 12-75.
6. O. Marcotte, Exact edge-colorings of graphs without prescribed minors, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1 (1990), 235-243.
7. P. D. Seymour, Colouring series-parallel graphs, Combinatorica 10, No. 4 (1990), 379-392.
8. M. Sysło, NP-complete problems on some tree-structured graphs: A review, in "Proceedings WG'83 International Workshop on Graph Theoretic Concepts in Computer Science," pp. 478-489, Univ. Verlag Rudolf Trauncer, Linz, 1983.
9. K. Takamizawa, T. Nishizeki, and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29, No. 3 (1982), 623-641.
10. O. Terada and T. Nishizeki, Approximate algorithms for the edge-coloring of graphs. Trans. Inst. Electronics Comm. Eng. Japan J65-D 11, No. 4 (1982), 1382-1389.
11. X. Zhou, S. Nakano, and T. Nishizeki, A linear algorithm for edge-coloring partial k-trees, in "Proceedings of the First Europian Symposium on Algorithms," pp. 409-418, Lecture Notes in Computer Science, Vol. 726, Springer-Verlag, Berlin/New York, 1993.
12. X. Zhou, S. Nakano, and T. Nishizeki, A parallel algorithm for edge-coloring partial k-trees, in "Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory," pp. 359-369, Lecture Notes in Computer Science, Vol. 824, Springer-Verlag, Berlin/New York, 1994.
13. X. Zhou, S. Nakano, H. Suzuki, and T. Nishizeki, An efficient algorithm for edge-coloring series-parallel multigraphs, in "Proceedings of LATIN'92" (I. Simon, Ed.), pp. 516-529, Lecture Notes in Computer Science, Vol. 583, Springer-Verlag, Berlin/New York, 1992.
14. X. Zhou, H. Suzuki, and T. Nishizeki, Sequential and parallel algorithms for edge-coloring series-parallel multigraphs, in "Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization," pp. 129-145, 1993.