Edge-Coloring Partial k-Trees

Xiao Zhou, Shin Ichi Nakano, Takao Nishizek

研究成果: Article

32 被引用数 (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 efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity. This paper gives a linear-time sequential algorithm and an optimal parallel algorithm which find an edge-coloring of a given partial k-tree with the minimum number of colors for fixed k. & 1996 Academic Press, Inc.

本文言語English
ページ(範囲)598-617
ページ数20
ジャーナルJournal of Algorithms
21
3
DOI
出版ステータスPublished - 1996 11

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics

フィンガープリント 「Edge-Coloring Partial k-Trees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル