Algorithms for the multicolorings of partial k-trees

Takehiro Ito, Takao Nishizeki, Gyo Shu

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Let each vertex v of a graph G have a positive integer weight ω(v). Then a multicoloring of G is to assign each vertex v a set of ω(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
ホスト出版物のタイトルComputing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
編集者Oscar H. Ibarra, Louxin Zhang
出版社Springer-Verlag
ページ430-439
ページ数10
ISBN(印刷版)354043996X, 9783540439967
出版ステータスPublished - 2002 1 1
イベント8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore
継続期間: 2002 8 152002 8 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2387
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other8th Annual International Conference on Computing and Combinatorics, COCOON 2002
国/地域Singapore
CitySingapore
Period02/8/1502/8/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Algorithms for the multicolorings of partial k-trees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル