836 search results - page 92 / 168 » Orthogonal Colorings of Graphs |
103
click to vote
INFOCOM
2009
IEEE
15 years 10 months 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...
110
Voted
ICCAD
1996
IEEE
15 years 8 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 ...
127
click to vote
JCB
2006
15 years 3 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...
147
click to vote
CPC
2004
15 years 3 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
119
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...