Pentti A. Honkanen. A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph. In Danny R. Carter, editor, Proceedings of the 15th annual Southeast regional conference, ACM-SE 1977, Hattiesburg, Mississippi, USA, April 18-20, 1977. pages 458-469, ACM, 1977. [doi]
@inproceedings{Honkanen77,
title = {A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph},
author = {Pentti A. Honkanen},
year = {1977},
doi = {10.1145/1795396.1795459},
url = {https://doi.org/10.1145/1795396.1795459},
researchr = {https://researchr.org/publication/Honkanen77},
cites = {0},
citedby = {0},
pages = {458-469},
booktitle = {Proceedings of the 15th annual Southeast regional conference, ACM-SE 1977, Hattiesburg, Mississippi, USA, April 18-20, 1977},
editor = {Danny R. Carter},
publisher = {ACM},
isbn = {978-1-4503-7302-9},
}