1949 search results - page 247 / 390 » Random graphs on surfaces |
212
click to vote
FOCS
2006
IEEE
16 years 2 days ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
174
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
142
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
135
click to vote
DCC
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
177
click to vote
WDAG
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...