Optimal Parallel Algorithms for Edge-Coloring Partial k-Trees with Bounded Degrees

Xiao ZHOU  Takao NISHIZEKI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E78-A   No.4   pp.463-469
Publication Date: 1995/04/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
edge-coloring,  parallel algorithm,  DP algorithm,  

Full Text: PDF(605KB)>>
Buy this Article




Summary: 
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 with bounded degrees using a minimum number of colors. In the paper k is assumed to be bounded.