Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees

Gyo Shu, Takao Nishizeki

研究成果: Paper査読

3 被引用数 (Scopus)

抄録

Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by k). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial k-trees. This paper gives an optimal and first NC parallel algorithm to find an edge-coloring of any given partial k-tree using a minimum number of colors if k and the maximum degree Δ are bounded.

本文言語English
ページ167-174
ページ数8
出版ステータスPublished - 1994 12 1
イベントProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) - Kanazawa, Jpn
継続期間: 1994 12 141994 12 16

Other

OtherProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)
CityKanazawa, Jpn
Period94/12/1494/12/16

ASJC Scopus subject areas

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

フィンガープリント

「Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル