@inproceedings{f49c518aa70540ea9968b35dc2b58539,
title = "Parallel edge coloring of a tree on a mesh connected computer",
abstract = "An edge coloring is an assignment of colors to the edges of a graph so that no two edges with a common vertex have the same color. We show that, given an undirected tree T with n vertices, a minimum edge coloring of T can be determined in O(p n) time on a p(n) p (n) mesh-connected computer(MCC) by a novel technique which decomposes the tree into disjoint chains and then assigns the edge colors in each chain properly. The time complexity is optimal on MCC within constant factor.",
author = "Jeong, {Chang Sung} and Cho, {Sung Up} and Whang, {Sun Chul} and Choi, {Mi Young}",
year = "2000",
doi = "10.1007/3-540-44929-9_6",
language = "English",
isbn = "3540678239",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "76--83",
editor = "{van Leeuwen}, Jan and Osamu Watanabe and Masami Hagiya and Mosses, {Peter D.} and Takayasu Ito",
booktitle = "Theoretical Computer Science",
note = " 1st IFIP International Conference on Theoretical Computer Science, TCS 2000 ; Conference date: 17-08-2000 Through 19-08-2000",
}