TY - JOUR
T1 - An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs
AU - Zhou, Xiao
AU - Suzuki, Hitoshi
AU - Nishizeki, Takao
N1 - Funding Information:
We thank Dr. Shin-ichi Nakano for various comments and for help in preparing this paper. We thank the anonymous referees for many useful comments. This research is partly supported by a Grant in Aid for Scientific Research of the Ministry of Education, Science, and Culture of Japan under General Research C) 04650300.
PY - 1997/5
Y1 - 1997/5
N2 - Many combinatorial problems can be efficiently solved in parallel for series-parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series-parallel multigraphs. This paper gives an NC parallel algorithm for the problem on series-parallel multigraphs G. It takes O(log n) time with O(Δn/log n) processors, where n is the number of vertices and Δ is the maximum degree of G.
AB - Many combinatorial problems can be efficiently solved in parallel for series-parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series-parallel multigraphs. This paper gives an NC parallel algorithm for the problem on series-parallel multigraphs G. It takes O(log n) time with O(Δn/log n) processors, where n is the number of vertices and Δ is the maximum degree of G.
UR - http://www.scopus.com/inward/record.url?scp=0141506558&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141506558&partnerID=8YFLogxK
U2 - 10.1006/jagm.1996.0830
DO - 10.1006/jagm.1996.0830
M3 - Article
AN - SCOPUS:0141506558
VL - 23
SP - 359
EP - 374
JO - Journal of Algorithms
JF - Journal of Algorithms
SN - 0196-6774
IS - 2
ER -