An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree

@inproceedings{Moret1992AnEA,
  title={An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree},
  author={Bernard M. E. Moret and Henry D. Shapiro},
  booktitle={Computational Support for Discrete Mathematics},
  year={1992}
}

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 65 extracted citations

The saga of minimum spanning trees

Computer Science Review • 2008
View 4 Excerpts
Highly Influenced

Exploring the parallel implementations of the three classical MST algorithms

2017 International Conference on Inventive Communication and Computational Technologies (ICICCT) • 2017
View 2 Excerpts

Toward Optimal Self-Adjusting Heaps

ACM Trans. Algorithms • 2017
View 1 Excerpt

An efficient Minimum Spanning Tree algorithm

2016 IEEE Symposium on Computers and Communication (ISCC) • 2016
View 1 Excerpt

A Generic and Highly Efficient Parallel Variant of Boruvka's Algorithm

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing • 2015
View 2 Excerpts

A greedy approach for minimizing SDN control overhead

Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft) • 2015
View 1 Excerpt

Similar Papers

Loading similar papers…