2310 search results - page 111 / 462 » Coloring Random Graphs |
154
click to vote
SASO
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
135
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
145
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
172
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
174
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...