Li-Jen Mao, Sheau-Dong Lang. Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. In 31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 20-23 August 2002, Vancouver, BC, Canada. pages 398-404, IEEE Computer Society, 2002. [doi]
@inproceedings{MaoL02,
title = {Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique},
author = {Li-Jen Mao and Sheau-Dong Lang},
year = {2002},
url = {http://csdl.computer.org/comp/proceedings/icppw/2002/1680/00/16800398abs.htm},
tags = {traversal},
researchr = {https://researchr.org/publication/MaoL02},
cites = {0},
citedby = {0},
pages = {398-404},
booktitle = {31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 20-23 August 2002, Vancouver, BC, Canada},
publisher = {IEEE Computer Society},
isbn = {0-7695-1680-7},
}