23 search results - page 2 / 5 » A Coarse-Grained Parallel Algorithm for Spanning Tree and Co... |
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
CATS
2007
13 years 6 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
ESA
1998
Springer
13 years 9 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...