Engineering an External Memory Minimum Spanning Tree Algorithm (2004)
Cached
Download Links
- [www14.informatik.tu-muenchen.de]
- [algo2.iti.uni-karlsruhe.de]
- [i10www.ira.uka.de]
- [algo2.iti.uka.de]
- [algo2.iti.kit.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 3rd IFIP Intl. Conf. on Theoretical Computer Science |
| Citations: | 14 - 2 self |
BibTeX
@INPROCEEDINGS{Dementiev04engineeringan,
author = {Roman Dementiev and Peter S and Dominik Schultes and Jop Sibeyn},
title = {Engineering an External Memory Minimum Spanning Tree Algorithm},
booktitle = {In Proc. 3rd IFIP Intl. Conf. on Theoretical Computer Science},
year = {2004},
pages = {195--208},
publisher = {Kluwer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract 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.
