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

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