Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique | IEEE Conference Publication | IEEE Xplore