1749 search results - page 66 / 350 » Conditional colorings of graphs |
156
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
170
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
170
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
176
click to vote
JGT
2008
15 years 6 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
151
click to vote
DM
2008
15 years 6 months ago
2008
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...