Efficient algorithms for weighted colorings of series-parallel graphs

Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages514-524
Number of pages11
DOIs
Publication statusPublished - 2001
Event12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
Duration: 2001 Dec 192001 Dec 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2223 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
Country/TerritoryNew Zealand
CityChristchurch
Period01/12/1901/12/21

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Efficient algorithms for weighted colorings of series-parallel graphs'. Together they form a unique fingerprint.

Cite this