Efficient algorithms for weighted colorings of series-parallel graphs

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

Volumn 2223 LNCS, Issue , 2001, Pages 514-524

  Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT VERTICES; DISJOINT SETS; EFFICIENT ALGORITHM; POSITIVE INTEGERS; SERIES-PARALLEL GRAPH; VERTEX- WEIGHTS; WEIGHTED COLORING; WEIGHTED GRAPH;

COLOR; COLORING; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; PARALLEL ALGORITHMS; SET THEORY; ALGORITHMS;

GRAPH THEORY;

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

References (9)

1. S. Arnborg and J. Lagergren. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, 1991. 517
2. E. Balas and J. Xue. Minimum weighted colouring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbirary graphs. SIAM. J. Comput., 20:209-221, 1991. 515
3. H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, 11(4):631-643, 1990. 517
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:555-581, 1992. 517
5. C. T. Hoáng. Efficient algorithms for minimum weighted colouring of some classes of perfect graphs. Discrete Applied Mathematics, 55:133-143, 1994. 515
6. D. Karger, C. Stein, and J. Wein. Scheduling algorithms, in "Algorithms and Theory of Computation Handbook" (Editor M. J. Atallah), CRC Press, 1998. 514
7. K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. Journal of ACM, 29(3):623-641, 1982. 515, 516, 517, 521
8. X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial k-trees. Journal of Algorithms, 21:598-617, 1996. 517
9. X. Zhou, H. Suzuki, and T. Nishizeki. A linear algorithm for edge-coloring series-parallel multigraphs, Journal of Algorithms, 20:174-201, 1996. 516