Advertisement

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings

  • Takehiro Ito
  • Naoki Sakamoto
  • Xiao Zhou
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6213)

Abstract

Let C be a set of colors, and let ω(c) be an integer cost assigned to a 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 C. The cost ω(f) of an edge-coloring f of G is the sum of costs ω(f(e)) of colors f(e) assigned to all edges e in G. An edge-coloring f of G is optimal if ω(f) is minimum among all edge-colorings of G. In this paper, we show that the problem of finding an optimal edge-coloring of a tree T can be simply reduced in polynomial time to the minimum weight perfect matching problem for a new bipartite graph constructed from T. The reduction immediately yields an efficient simple algorithm to find an optimal edge-coloring of T in time Open image in new window , where n is the number of vertices in T, Δ is the maximum degree of T, and N ω is the maximum absolute cost |ω(c)| of colors c in C. We then show that our result can be extended for multitrees.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cardinal, J., Ravelomanana, V., Valencia-Pabon, M.: Chromatic edge strength of some multigraphs. Electronic Notes in Discrete Mathematics 30, 39–44 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Coffman, E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Computing 14, 744–780 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Computing 18, 1013–1036 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Information Processing Letters 75, 65–69 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Hajiabolhassan, H., Mehrabadi, M.L., Tusserkani, R.: Minimal coloring and strength of graphs. Discrete Mathematics 215, 265–270 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Computers 34, 869–872 (1985)CrossRefGoogle Scholar
  7. 7.
    Marx, D.: Complexity results for minimum sum edge coloring. Discrete Applied Mathematics 157, 1034–1045 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Mitchem, J., Morriss, P., Schmeichel, E.: On the cost chromatic number of outerplanar, planar, and line graphs. Discussiones Mathematicae Graph Theory 17, 229–241 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2000)Google Scholar
  10. 10.
    Zhou, X., Nishizeki, T.: Algorithm for the cost edge-coloring of trees. J. Combinatorial Optimization 8, 97–108 (2004)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Takehiro Ito
    • 1
  • Naoki Sakamoto
    • 1
  • Xiao Zhou
    • 1
  • Takao Nishizeki
    • 2
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan
  2. 2.School of Science and TechnologyKwansei Gakuin UniversitySandaJapan

Personalised recommendations