Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs

  • Xiao Zhou
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)


Let G be a weighted graph such that each vertex v has a positive integer weight \( w\left( v \right) \) . A weighted coloring of G is to assign a set of \( w\left( v \right) \) colors to each vertex \( v \) so that any two adjacent vertices receive disjoint sets of colors. This paper gives an efficient algorithm to find the minimum number of colors required for a weighted coloring of a given series-parallel graph G in time \( O\left( {nw_{max} } \right) \) , where n is the number of vertices and \( w_{max} \) is the maximum vertex-weight of G.


Weighted Graph Parallel Connection Perfect Graph Preemptive Schedule Minimum Completion Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Arnborg and J. Lagergren. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308–340, 1991.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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.CrossRefzbMATHGoogle Scholar
  3. 3.
    H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, 11(4):631–643, 1990.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    C. T. Hoáng. Efficient algorithms for minimum weighted colouring of some classes of perfect graphs. Discrete Applied Mathematics, 55:133–143, 1994.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    D. Karger, C. Stein, and J. Wein. Scheduling algorithms, in “Algorithms and Theory of Computation Handbook” (Editor M. J. Atallah), CRC Press, 1998.Google Scholar
  7. 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.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial k-trees. Journal of Algorithms, 21:598–617, 1996.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    X. Zhou, H. Suzuki, and T. Nishizeki. A linear algorithm for edge-coloring seriesparallel multigraphs, Journal of Algorithms, 20:174–201, 1996.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Xiao Zhou
    • 1
  • Takao Nishizeki
    • 1
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations