765 search results - page 82 / 153 » Graph Coloring with Rejection |
156
click to vote
COMBINATORICS
2004
15 years 5 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
162
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
129
click to vote
INFOCOM
2009
IEEE
16 years 20 days ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
130
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
156
click to vote
JCB
2006
15 years 6 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...