Optimal parallel algorithms for edge-coloring partial k-trees with bounded degrees

Xiao Zhou, Takao Nishizeki

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)463-469
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number4
Publication statusPublished - 1995 Apr 1

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Optimal parallel algorithms for edge-coloring partial k-trees with bounded degrees'. Together they form a unique fingerprint.

Cite this