Mao, L., & Lang, S. (2002). Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique. Proceedings. International Conference on Parallel Processing Workshop, 398-404. https://doi.org/10.1109/ICPPW.2002.1039757
Chicago-Zitierstil (17. Ausg.)Mao, Li-Jen, und Sheau-Dong Lang. "Parallel Algorithms for the Degree-constrained Minimum Spanning Tree Problem Using Nearest-neighbor Chains and the Heap-traversal Technique." Proceedings. International Conference on Parallel Processing Workshop 2002: 398-404. https://doi.org/10.1109/ICPPW.2002.1039757.
MLA-Zitierstil (9. Ausg.)Mao, Li-Jen, und Sheau-Dong Lang. "Parallel Algorithms for the Degree-constrained Minimum Spanning Tree Problem Using Nearest-neighbor Chains and the Heap-traversal Technique." Proceedings. International Conference on Parallel Processing Workshop, 2002, pp. 398-404, https://doi.org/10.1109/ICPPW.2002.1039757.