Algorithm for the cost edge-coloring of trees

Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Citations (Scopus)


Let C be a set of colors, and let ω be a cost function which assigns a real number ω(c) to each color c in C. An edge-coloring of a graph G is to color all the edges of G so that any two adjacent edges are colored with different colors. In this paper we give an efficient algorithm to find an optimal edge-coloring of a given tree T, that is, an edge-coloring f of T such that the sum of costs ω(f(e)) of colors f(e) assigned to all edges e is minimum among all edge-colorings of T. The algorithm takes time O(nΔ2) if n is the number of vertices and Δ is the maximum degree of T.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings
EditorsJie Wang
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540424949
Publication statusPublished - 2001
Event7th Annual International Conference on Computing and Combinatorics, COCOON 2001 - Guilin, China
Duration: 2001 Aug 202001 Aug 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th Annual International Conference on Computing and Combinatorics, COCOON 2001


Dive into the research topics of 'Algorithm for the cost edge-coloring of trees'. Together they form a unique fingerprint.

Cite this