Cite
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.
MLA
Kao, Shih-Shun, et al. “A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.” Journal of Parallel & Distributed Computing, vol. 181, Nov. 2023, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.jpdc.2023.104731.
APA
Kao, S.-S., Klasing, R., Hung, L.-J., Lee, C.-W., & Hsieh, S.-Y. (2023). A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. Journal of Parallel & Distributed Computing, 181, N.PAG. https://doi.org/10.1016/j.jpdc.2023.104731
Chicago
Kao, Shih-Shun, Ralf Klasing, Ling-Ju Hung, Chia-Wei Lee, and Sun-Yuan Hsieh. 2023. “A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.” Journal of Parallel & Distributed Computing 181 (November): N.PAG. doi:10.1016/j.jpdc.2023.104731.