Parallel edge coloring of a tree on a mesh connected computer

Chang-Sung Jeong, Sung Up Cho, Sun Chul Whang, Mi Young Choi

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

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages76-83
Number of pages8
Volume1872 LNCS
Publication statusPublished - 2000 Dec 1
Event1st IFIP International Conference on Theoretical Computer Science, TCS 2000 - Sendai, Japan
Duration: 2000 Aug 172000 Aug 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1872 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st IFIP International Conference on Theoretical Computer Science, TCS 2000
CountryJapan
CitySendai
Period00/8/1700/8/19

Fingerprint

Mesh-connected Computer
Edge Coloring
Coloring
Color
Time Complexity
Assign
Disjoint
Assignment
Decompose
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Jeong, C-S., Cho, S. U., Whang, S. C., & Choi, M. Y. (2000). Parallel edge coloring of a tree on a mesh connected computer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1872 LNCS, pp. 76-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1872 LNCS).

Parallel edge coloring of a tree on a mesh connected computer. / Jeong, Chang-Sung; Cho, Sung Up; Whang, Sun Chul; Choi, Mi Young.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1872 LNCS 2000. p. 76-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1872 LNCS).

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

Jeong, C-S, Cho, SU, Whang, SC & Choi, MY 2000, Parallel edge coloring of a tree on a mesh connected computer. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1872 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1872 LNCS, pp. 76-83, 1st IFIP International Conference on Theoretical Computer Science, TCS 2000, Sendai, Japan, 00/8/17.
Jeong C-S, Cho SU, Whang SC, Choi MY. Parallel edge coloring of a tree on a mesh connected computer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1872 LNCS. 2000. p. 76-83. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Jeong, Chang-Sung ; Cho, Sung Up ; Whang, Sun Chul ; Choi, Mi Young. / Parallel edge coloring of a tree on a mesh connected computer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1872 LNCS 2000. pp. 76-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 = "Chang-Sung Jeong and Cho, {Sung Up} and Whang, {Sun Chul} and Choi, {Mi Young}",
year = "2000",
month = "12",
day = "1",
language = "English",
isbn = "3540678239",
volume = "1872 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "76--83",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Parallel edge coloring of a tree on a mesh connected computer

AU - Jeong, Chang-Sung

AU - Cho, Sung Up

AU - Whang, Sun Chul

AU - Choi, Mi Young

PY - 2000/12/1

Y1 - 2000/12/1

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:84879070793

SN - 3540678239

SN - 9783540678236

VL - 1872 LNCS

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

SP - 76

EP - 83

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

ER -