Sciweavers

Share
IFIP
2004
Springer

Engineering an External Memory Minimum Spanning Tree Algorithm

10 years 3 months ago
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs. Our implementation indicates that this algorithm processes graphs only limited by the disk capacity of most current machines in time no more than a factor 2–5 of a good internal algorithm with sufficient memory space.
Roman Dementiev, Peter Sanders, Dominik Schultes,
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IFIP
Authors Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn
Comments (0)
books