762 search results - page 81 / 153 » Strategic Coloring of a Graph |
134
click to vote
COMBINATORICS
2004
15 years 4 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...
139
click to vote
APPROX
2004
Springer
15 years 10 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...
109
click to vote
INFOCOM
2009
IEEE
15 years 11 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...
113
click to vote
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 ...
126
click to vote
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...