362 search results - page 14 / 73 » A Branch-and-Cut algorithm for graph coloring |
135
click to vote
SIAMDM
2008
15 years 4 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
122
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
133
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
129
click to vote
SIBGRAPI
2006
IEEE
15 years 10 months ago
2006
IEEE
Region-based approaches to cel painting typically use shape similarity and topology relations between regions of consecutive animation frames. This paper presents a new colorizati...
140
click to vote
ENDM
2006
15 years 4 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...