460 search results - page 2 / 92 » New Tools for Graph Coloring |
DAM
2006
13 years 4 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
CGA
2004
13 years 4 months ago
2004
Color is fundamental in computer graphics imagery. But despite the importance of good color selection and the difficulty most people have making those color selections, current gr...
SIAMDM
2008
13 years 4 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
LCPC
1994
Springer
13 years 8 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...