抄録
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月 14 → 1994 12月 16 |
Other
| Other | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) |
|---|---|
| City | Kanazawa, Jpn |
| Period | 94/12/14 → 94/12/16 |
ASJC Scopus subject areas
- コンピュータ サイエンス（全般）