Algorithms for multicolorings of partial k-trees

Takehiro Ito, Takao Nishizeki, Xiao Zhou

研究成果: Article

6 引用 (Scopus)

抜粋

Let each vertex v of a graph G have a positive integer weight w(v). Then a multicoloring of G is to assign each vertex v a set of w(v) colors so that any pair of adjacent vertices receive disjoint sets of colors. A partial k-tree is a graph with tree-width bounded by a fixed constant k. This paper presents an algorithm which finds a multicoloring of any given partial k-tree G with the minimum number of colors. The computation time of the algorithm is bounded by a polynomial in the number of vertices and the maximum weight of vertices in G.

元の言語English
ページ(範囲)191-200
ページ数10
ジャーナルIEICE Transactions on Information and Systems
E86-D
発行部数2
出版物ステータスPublished - 2003 2

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

フィンガープリント Algorithms for multicolorings of partial k-trees' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用