1591 search results - page 80 / 319 » Random lifts of graphs |
159
click to vote
AICCSA
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
228
click to vote
STACS
2012
Springer
14 years 1 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
154
click to vote
RANDOM
1999
Springer
15 years 10 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
146
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
167
click to vote
JSAC
2007
15 years 6 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...