Cite
A two-stages tree-searching algorithm for finding three completely independent spanning trees.
MLA
Pai, Kung-Jui, et al. “A Two-Stages Tree-Searching Algorithm for Finding Three Completely Independent Spanning Trees.” Theoretical Computer Science, vol. 784, Sept. 2019, pp. 65–74. EBSCOhost, https://doi.org/10.1016/j.tcs.2019.03.035.
APA
Pai, K.-J., Chang, R.-S., Wu, R.-Y., & Chang, J.-M. (2019). A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theoretical Computer Science, 784, 65–74. https://doi.org/10.1016/j.tcs.2019.03.035
Chicago
Pai, Kung-Jui, Ruay-Shiung Chang, Ro-Yu Wu, and Jou-Ming Chang. 2019. “A Two-Stages Tree-Searching Algorithm for Finding Three Completely Independent Spanning Trees.” Theoretical Computer Science 784 (September): 65–74. doi:10.1016/j.tcs.2019.03.035.