1749 search results - page 111 / 350 » Conditional colorings of graphs |
173
click to vote
APPROX
2004
Springer
15 years 12 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...
133
click to vote
INFOCOM
2009
IEEE
16 years 1 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...
161
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...
183
click to vote
CPC
2004
15 years 6 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...
159
click to vote
ICALP
2001
Springer
15 years 11 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 ...