Sciweavers

334 search results - page 9 / 67
» Practical Parallel Algorithms for Minimum Spanning Trees
Sort
View
99
Voted
TALG
2008
80views more  TALG 2008»
15 years 2 months ago
Randomized minimum spanning tree algorithms using exponentially fewer random bits
Seth Pettie, Vijaya Ramachandran
ICCNMC
2005
Springer
15 years 8 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
IPPS
2010
IEEE
15 years 25 days ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava