718 search results - page 46 / 144 » Coloring quasi-line graphs |
184
click to vote
CC
1998
Springer
15 years 6 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
162
click to vote
LCPC
2005
Springer
15 years 11 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
181
click to vote
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
We lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). Based on this framework, we analyze two watermarking techniques ...
155
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...
169
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...