Francis Y. L. Chin, H. F. Ting. An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. In 26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA. pages 257-266, IEEE, 1985.
@inproceedings{ChinT85,
title = {An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees},
author = {Francis Y. L. Chin and H. F. Ting},
year = {1985},
tags = {e-science},
researchr = {https://researchr.org/publication/ChinT85},
cites = {0},
citedby = {0},
pages = {257-266},
booktitle = {26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA},
publisher = {IEEE},
}