### 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.

Original language | English |
---|---|

Pages | 167-174 |

Number of pages | 8 |

Publication status | Published - 1994 Dec 1 |

Event | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) - Kanazawa, Jpn Duration: 1994 Dec 14 → 1994 Dec 16 |

### Other

Other | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) |
---|---|

City | Kanazawa, Jpn |

Period | 94/12/14 → 94/12/16 |

### ASJC Scopus subject areas

- Computer Science(all)

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

## Cite this

Shu, G., & Nishizeki, T. (1994).

*Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees*. 167-174. Paper presented at Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), Kanazawa, Jpn, .