Sciweavers

334 search results - page 9 / 67
» Practical Parallel Algorithms for Minimum Spanning Trees
Sort
View
95
Voted
CN
2008
93views more  CN 2008»
15 years 3 months ago
A fast algorithm for computing minimum routing cost spanning trees
Rui Campos, Manuel Ricardo
130
Voted
ICCNMC
2005
Springer
15 years 9 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
114
Voted
ESA
1998
Springer
159views Algorithms» more  ESA 1998»
15 years 7 months ago
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures
Enrico Nardelli, Guido Proietti, Peter Widmayer
137
Voted
IPPS
2010
IEEE
15 years 1 months 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