Sciweavers

221 search results - page 5 / 45
» Twinkle: programming with color
Sort
View
ANOR
2005
72views more  ANOR 2005»
15 years 7 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
144
Voted
FOCS
1994
IEEE
15 years 11 months ago
Approximate Graph Coloring by Semidefinite Programming
David R. Karger, Rajeev Motwani, Madhu Sudan