1749 search results - page 105 / 350 » Conditional colorings of graphs |
188
click to vote
SAT
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
142
click to vote
RSA
2008
15 years 5 months ago
2008
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
182
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
223
click to vote
AROBOTS
2007
15 years 6 months ago
2007
— A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. To operate in the real world, autonomo...