617 search results - page 47 / 124 » On the Chromatic Number of Random Graphs |
181
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
129
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...
168
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...
118
click to vote
LCN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
148
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...