A semidefinite programming-based heuristic for graph coloring

  title={A semidefinite programming-based heuristic for graph coloring},
  author={Igor Dukanovic and Franz Rendl},
  journal={Discrete Applied Mathematics},
The Lovász θ-function is a well-known polynomial lower bound on the chromatic number. Any near optimal solution of its semidefinite programming formulation carries valuable information on how to color the graph. A self-contained presentation of the role of this formulation in obtaining heuristics for the graph coloring problem is presented. 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 11 extracted citations

Solution to graph coloring problem using divide and conquer based genetic method

2016 International Conference on Information Communication and Embedded Systems (ICICES) • 2016
View 2 Excerpts

Lovasz ϑ, SVMs and applications

2013 IEEE Information Theory Workshop (ITW) • 2013
View 2 Excerpts


Publications referenced by this paper.
Showing 1-10 of 28 references

Strengthening the Lovász Theta(G) bound for graph coloring

Math. Program. • 2005
View 4 Excerpts
Highly Influenced

On the Shannon capacity of a graph

IEEE Trans. Information Theory • 1979
View 3 Excerpts
Highly Influenced

forthcoming). “Semidefinite programming applied to graph coloring problem

I. Dukanovic
PhD thesis • 2005
View 1 Excerpt

Genetic algorithm for graph coloring: exploration of Galinier and Hao’s algorithm

C. A. Glass, A. Pruegel-Bennett
Journal of Combinatorial Optimization, • 2003
View 2 Excerpts

Semidefinite optimization

M. J. Todd
Acta Numer., • 2001
View 2 Excerpts

Similar Papers

Loading similar papers…