Max-Coloring of Vertex-Weighted Graphs
- 21 March 2015
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 191-198
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximationDiscrete Applied Mathematics, 2009
- A Note on First-Fit Coloring of Interval GraphsOrder, 2008
- Weighted Coloring: further complexity and approximability resultsInformation Processing Letters, 2006
- Approximation Algorithms for the Max-coloring Problem2005
- Buffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs2002
- Weighted Node Coloring: When Stable Sets Are Expensive2002
- A coloring problem for weighted graphsInformation Processing Letters, 1997
- Effective colorationThe Journal of Symbolic Logic, 1976