### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 76-83 |

Number of pages | 8 |

Volume | 1872 LNCS |

Publication status | Published - 2000 Dec 1 |

Event | 1st IFIP International Conference on Theoretical Computer Science, TCS 2000 - Sendai, Japan Duration: 2000 Aug 17 → 2000 Aug 19 |

### Publication series

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

Volume | 1872 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 1st IFIP International Conference on Theoretical Computer Science, TCS 2000 |
---|---|

Country | Japan |

City | Sendai |

Period | 00/8/17 → 00/8/19 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

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

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

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

}

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 -