A semidefinite programming-based heuristic for graph coloring
نویسندگان
چکیده
منابع مشابه
A semidefinite programming-based heuristic for graph coloring
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.
متن کاملSemidefinite programming relaxations for graph coloring and maximal clique problems
The semidefinite programming formulation of the Lovász theta number does not only give one of the best polynomial simultaneous bounds on the chromatic number χ(G) or the clique number ω(G) of a graph, but also leads to heuristics for graph coloring and extracting large cliques. This semidefinite programming formulation can be tightened toward either χ(G) or ω(G) by adding several types of cutti...
متن کاملA Report on Approximate Graph Coloring by Semidefinite Programming
In this report, some results on semidefinite programming relaxation of graph coloring are summarized. Two algorithms on semicoloring/coloring are described in detail for 3-colorable graphs. The relation between semidefinite programming relaxation and the Lovász theta function is simply introduced.
متن کاملA Parallel Graph Coloring Heuristic
The problem of computing good graph colorings arises in many diverse applications , such as in the estimation of sparse Jacobians and in the development of eecient, parallel iterative methods for solving sparse linear systems. In this paper we present an asynchronous graph coloring heuristic well suited to distributed memory parallel computers. We present experimental results obtained on an Int...
متن کاملA Range-Compaction Heuristic for Graph Coloring
This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a \pressure" component and an annealing schedule for it. The value of this component is empirically quanti ed. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.07.014