2084 search results - page 127 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
117
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
97
Voted
CACM
2008
15 years 5 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
146
Voted
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
145
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
128
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...