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

}