A network-flow-based lower bound for the minimum weighted integer coloring problem
References (14)
- et al.
A theoretical analysis of backtracking in the graph coloring problem
J. Algorithms
(1985) Heuristic coloring of weighted graphs and the maximum weight clique problem
(1991)- et al.
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs
SIAM J. Comput.
(1991) Some lower bounds for a class of frequency assignment problems
IEEE Trans. Vehicular Technol.
(1986)- et al.
On colouring random graphs
Math. Proc. Cambridge Philos. Soc.
(1975) - et al.
A generalized implicit enumeration algorithm for graph coloring
Comm. ACM
(1985) - et al.
A column generation approach for graph coloring
INFORMS J. Comput.
(1996)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2000 Elsevier Science B.V. All rights reserved.