2310 search results - page 109 / 462 » Coloring Random Graphs |
120
Voted
CC
2006
Springer
15 years 6 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
107
Voted
DAC
2000
ACM
16 years 3 months ago
2000
ACM
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
122
click to vote
AUSAI
2005
Springer
15 years 7 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
130
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
121
Voted
CPC
2007
15 years 2 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...