An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)359-374
Number of pages16
JournalJournal of Algorithms
Issue number2
Publication statusPublished - 1997 May

ASJC Scopus subject areas

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


Dive into the research topics of 'An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs'. Together they form a unique fingerprint.

Cite this