Algorithms for finding f-colorings of partial k-trees

Xiao Zhou, Takao Nishizeki

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ϵ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ϵ V at most f(v) times, where f(v) is a positive integer assigned to v. This paper gives a lineax-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a given-partial k-tree with the minimum number of colors.

本文言語English
ホスト出版物のタイトルAlgorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings
編集者Alistair Moffat, John Staples, Naoki Katoh, Peter Eades
出版社Springer-Verlag
ページ332-341
ページ数10
ISBN(印刷版)3540605738, 9783540605737
出版ステータスPublished - 1995 1 1
外部発表はい
イベント6th International Symposium on Algorithms and Computations, ISAAC 1995 - Cairns, Australia
継続期間: 1995 12 41995 12 6

出版物シリーズ

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

Other

Other6th International Symposium on Algorithms and Computations, ISAAC 1995
CountryAustralia
CityCairns
Period95/12/495/12/6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

引用スタイル