A Practical Minimum Spanning Tree Algorithm Using the Cycle Property (2003)
| Venue: | In 11th European Symposium on Algorithms (ESA), number 2832 in LNCS |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Katriel03apractical,
author = {Irit Katriel and Peter Sanders and Jesper Larsson Träff and Jesper Larsson Tra},
title = {A Practical Minimum Spanning Tree Algorithm Using the Cycle Property},
booktitle = {In 11th European Symposium on Algorithms (ESA), number 2832 in LNCS},
year = {2003},
pages = {679--690},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a simple new (randomized) algorithm for computing minimum spanning trees that is more than two times faster than the best previously known algorithms (for dense, "difficult" inputs). It is of conceptual interest that the algorithm uses the property that the heaviest edge in a cycle can be discarded. Previously this has only been exploited in asymptotically optimal algorithms that are considered impractical. An additional advantage is...
