2310 search results - page 117 / 462 » Coloring Random Graphs |
138
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
148
click to vote
CISS
2007
IEEE
15 years 6 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
126
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
107
click to vote
JGT
2007
15 years 2 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
100
Voted
CC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...