A parallel algorithm for edge-coloring partial κ-trees

Xiao Zhou; Shin ichi Nakano; Takao Nishizeki

doi:10.1007/3-540-58218-5_33

A parallel algorithm for edge-coloring partial κ-trees

Xiao Zhou, Shin ichi Nakano, Takao Nishizeki

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings
Editors	Erik M. Schmidt, Sven Skyum
Publisher	Springer Verlag
Pages	359-369
Number of pages	11
ISBN (Print)	9783540582182
DOIs	https://doi.org/10.1007/3-540-58218-5_33
Publication status	Published - 1994
Event	4th Scandinavian Workshop on Algorithm Theory, SWAT 1994 - Aarhus, Denmark Duration: 1994 Jul 6 → 1994 Jul 8

Publication series

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

Other

Other	4th Scandinavian Workshop on Algorithm Theory, SWAT 1994
Country	Denmark
City	Aarhus
Period	94/7/6 → 94/7/8

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-58218-5_33

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

Cite this

Zhou, X., Nakano, S. I., & Nishizeki, T. (1994). A parallel algorithm for edge-coloring partial κ-trees. In E. M. Schmidt, & S. Skyum (Eds.), Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings (pp. 359-369). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 824 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_33

A parallel algorithm for edge-coloring partial κ-trees. / Zhou, Xiao; Nakano, Shin ichi; Nishizeki, Takao.

Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings. ed. / Erik M. Schmidt; Sven Skyum. Springer Verlag, 1994. p. 359-369 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 824 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhou, X, Nakano, SI & Nishizeki, T 1994, A parallel algorithm for edge-coloring partial κ-trees. in EM Schmidt & S Skyum (eds), Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 824 LNCS, Springer Verlag, pp. 359-369, 4th Scandinavian Workshop on Algorithm Theory, SWAT 1994, Aarhus, Denmark, 94/7/6. https://doi.org/10.1007/3-540-58218-5_33

Zhou X, Nakano SI, Nishizeki T. A parallel algorithm for edge-coloring partial κ-trees. In Schmidt EM, Skyum S, editors, Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings. Springer Verlag. 1994. p. 359-369. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-58218-5_33

Zhou, Xiao ; Nakano, Shin ichi ; Nishizeki, Takao. / A parallel algorithm for edge-coloring partial κ-trees. Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings. editor / Erik M. Schmidt ; Sven Skyum. Springer Verlag, 1994. pp. 359-369 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cdc48b48ecb04a93afaec2d9d3403d57,

title = "A parallel algorithm for edge-coloring partial κ-trees",

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.",

author = "Xiao Zhou and Nakano, {Shin ichi} and Takao Nishizeki",

year = "1994",

doi = "10.1007/3-540-58218-5_33",

language = "English",

isbn = "9783540582182",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "359--369",

editor = "Schmidt, {Erik M.} and Sven Skyum",

booktitle = "Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings",

note = "4th Scandinavian Workshop on Algorithm Theory, SWAT 1994 ; Conference date: 06-07-1994 Through 08-07-1994",

}

TY - GEN

T1 - A parallel algorithm for edge-coloring partial κ-trees

AU - Zhou, Xiao

AU - Nakano, Shin ichi

AU - Nishizeki, Takao

PY - 1994

Y1 - 1994

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

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

UR - http://www.scopus.com/inward/record.url?scp=0347534674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347534674&partnerID=8YFLogxK

U2 - 10.1007/3-540-58218-5_33

DO - 10.1007/3-540-58218-5_33

M3 - Conference contribution

AN - SCOPUS:0347534674

SN - 9783540582182

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 359

EP - 369

BT - Algorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Schmidt, Erik M.

A2 - Skyum, Sven

PB - Springer Verlag

T2 - 4th Scandinavian Workshop on Algorithm Theory, SWAT 1994

Y2 - 6 July 1994 through 8 July 1994

ER -