765 search results - page 4 / 153 » Graph Coloring with Rejection |
COMBINATORICA
2007
14 years 11 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
CGF
2010
14 years 11 months ago
2010
The problem of noise in Monte-Carlo rendering arising from estimator variance is well-known and well-studied. In this work, we concentrate on identifying individual light paths as...
124
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
DAM
2006
14 years 11 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...
111
click to vote
ENDM
2006
14 years 11 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...