Bernard M. E. Moret, Henry D. Shapiro. An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, 2nd Workshop WADS 91, Ottawa, Canada, August 14-16, 1991, Proceedings. Volume 519 of Lecture Notes in Computer Science, pages 400-411, Springer, 1991.
@inproceedings{MoretS91:0,
title = {An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree},
author = {Bernard M. E. Moret and Henry D. Shapiro},
year = {1991},
tags = {analysis, e-science},
researchr = {https://researchr.org/publication/MoretS91%3A0},
cites = {0},
citedby = {0},
pages = {400-411},
booktitle = {Algorithms and Data Structures, 2nd Workshop WADS 91, Ottawa, Canada, August 14-16, 1991, Proceedings},
editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro},
volume = {519},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54343-0},
}