2310 search results - page 22 / 462 » Coloring Random Graphs |
DAM
2008
13 years 7 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R