Title :
Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees
Author :
Zhou, Xiao ; Nishizeki, Takao
Author_Institution :
Dept. of Syst. Inf. Sci., Tohoku Univ., Sendai, Japan
Abstract :
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
Keywords :
combinatorial mathematics; graph colouring; graph theory; parallel algorithms; bounded degrees; combinatorial problems; edge-coloring; first NC; optimal; parallel algorithm; partial k-trees; Concurrent computing; Dynamic programming; Heuristic algorithms; Knee; Logic; Parallel algorithms; Parallel architectures; Partitioning algorithms; Polynomials; Tree graphs;
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on
Conference_Location :
Kanazawa
Print_ISBN :
0-8186-6507-6
DOI :
10.1109/ISPAN.1994.367150
