TY - GEN

T1 - Efficient algorithms for weighted colorings of series-parallel graphs

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 2001

Y1 - 2001

N2 - Let G be a weighted graph such that each vertex v has a positive integer weight . A weighted coloring of G is to assign a set of colors to each vertex 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 , where n is the number of vertices and is the maximum vertex-weight of G.

AB - Let G be a weighted graph such that each vertex v has a positive integer weight . A weighted coloring of G is to assign a set of colors to each vertex 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 , where n is the number of vertices and is the maximum vertex-weight of G.

UR - http://www.scopus.com/inward/record.url?scp=71049193544&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049193544&partnerID=8YFLogxK

U2 - 10.1007/3-540-45678-3_44

DO - 10.1007/3-540-45678-3_44

M3 - Conference contribution

AN - SCOPUS:71049193544

SN - 3540429859

SN - 9783540429852

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

SP - 514

EP - 524

BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings

T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001

Y2 - 19 December 2001 through 21 December 2001

ER -