A parallel algorithm for edge-coloring partial κ-trees

Xiao Zhou, Shin ichi Nakano, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Many combinatorial problems can be efficiently solved for partial ktrees (graphs of treewidth bounded by κ). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial κ-trees. This paper gives an optimal and first NC parallel algorithm which finds an edge-coloring of a given partial κ-tree using a minimum number of colors.

Original languageEnglish
Title of host publicationAlgorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsErik M. Schmidt, Sven Skyum
PublisherSpringer Verlag
Pages359-369
Number of pages11
ISBN (Print)9783540582182
DOIs
Publication statusPublished - 1994
Event4th Scandinavian Workshop on Algorithm Theory, SWAT 1994 - Aarhus, Denmark
Duration: 1994 Jul 61994 Jul 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume824 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Scandinavian Workshop on Algorithm Theory, SWAT 1994
CountryDenmark
CityAarhus
Period94/7/694/7/8

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A parallel algorithm for edge-coloring partial κ-trees'. Together they form a unique fingerprint.

Cite this