66 search results - page 4 / 14 » Graph Coloring using Peer-to-Peer Networks |
NETWORKS
2010
13 years 6 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
SSS
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
IPL
2011
13 years 2 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
ANOR
2004
13 years 7 months ago
2004
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
INFOCOM
2009
IEEE
14 years 2 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...