Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme.

MLA

Cheng, Baolei, et al. “Constructing Node-Independent Spanning Trees on the Line Graph of the Hypercube by an Independent Forest Scheme.” Journal of Parallel & Distributed Computing, vol. 134, Dec. 2019, pp. 104–15. EBSCOhost, https://doi.org/10.1016/j.jpdc.2019.08.006.

APA

Cheng, B., Fan, J., Lin, C.-K., Jia, X., & Li, X. (2019). Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme. Journal of Parallel & Distributed Computing, 134, 104–115. https://doi.org/10.1016/j.jpdc.2019.08.006

Chicago

Cheng, Baolei, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia, and Xiaoyan Li. 2019. “Constructing Node-Independent Spanning Trees on the Line Graph of the Hypercube by an Independent Forest Scheme.” Journal of Parallel & Distributed Computing 134 (December): 104–15. doi:10.1016/j.jpdc.2019.08.006.