APA (7th ed.) Citation

Mao, L., Deo, N., & Lang, S. (1999). A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains. Proceedings / International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN), 184-189. https://doi.org/10.1109/ISPAN.1999.778937

Chicago Style (17th ed.) Citation

Mao, Li-Jen, Narsingh Deo, and Sheau-Dong Lang. "A Parallel Algorithm for the Degree-constrained Minimum Spanning Tree Problem Using Nearest-neighbor Chains." Proceedings / International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN) 1999: 184-189. https://doi.org/10.1109/ISPAN.1999.778937.

MLA (9th ed.) Citation

Mao, Li-Jen, et al. "A Parallel Algorithm for the Degree-constrained Minimum Spanning Tree Problem Using Nearest-neighbor Chains." Proceedings / International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN), 1999, pp. 184-189, https://doi.org/10.1109/ISPAN.1999.778937.