A coloring problem for weighted graphs
From MaRDI portal
Publication:286971
DOI10.1016/S0020-0190(97)00002-1zbMath1336.05041MaRDI QIDQ286971
F. Blanchet-Sadri, M. Dambrine
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
combinatorial problems; design of algorithms; weighted graph; greedy coloring; optimal coloring; real-time message transmission
Related Items
On the Max Coloring Problem, Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, Weighted coloring: further complexity and approximability results, Minimum cost and list homomorphisms to semicomplete digraphs, Polynomial approximation: a structural and operational study. (Abstract of thesis), Batch Coloring Flat Graphs and Thin