Abstract
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 edgecoloring 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg and J. Lagergren Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308–340, 1991.
R.B. Borie, R.G. Parker, and C.A. Tovey Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555–581, 1992.
E.G. Coffman, M.R. Garey, D.S. Johnson, and A.S. LaPaugh Scheduling file transfers. SIAM J. Comput., 14:744–780, 1985.
K. Giaro and M. Kubale Edge-chromatic sum of trees and bounded cyclicity graphs. Information Processing Letters, 75:65–69, 2000.
K. Jansen The optimum cost chromatic partition problem. In Proc. CIAC’97, Lecture Notes in Computer Science, Springer-Verlag, 1203:25–36, 1997.
H. Krawczyk and M. Kubale An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput., 34:869–872, 1985.
M.Y. Kao, T.W. Lam, W.K. Sung and H.F. Ting All-cavity maximum matchings. In Proc. ISAAC’97, Lecture Notes in Computer Science, Springer-Verlag, 1350:364–373, 1997.
M.Y. Kao, T.W. Lam, W.K. Sung and H.F. Ting Cavity matchings, label compressions, and evolutionary trees. SIAM J. Comp., 30(2):602–624, 2000.
L.G. Kroon, A. Sen, H. Deng, and A. Roy The optimal cost chromatic partition problem for trees and interval graphs. In Proc. WG’96 International Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer, 1197:279–292, 1997.
M. Kubale Introduction to Computational Complexity and Algorithmic Graph Coloring. Gdańskie Towarzystwo Naukowe, Gdańsk, Poland, 1998.
E. Kubicka The Chromatic Sum of a Graph. Ph.D. Thesis, Western Michigan University, 1989.
C.H. Padadimitriou and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982.
J.A. Telle and A. Proskurowski Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math., 10:529–550, 1997.
X. Zhou, S. Nakano, and T. Nishizeki Edge-coloring partial k-trees. Journal of Algorithms, 21:598–617, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, X., Nishizeki, T. (2001). Algorithm for the Cost Edge-Coloring of Trees. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_32
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive