Cite
An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs.
MLA
Huang, Yu-Sheng, et al. “An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs.” Journal of Interconnection Networks, vol. 16, no. 3/4, Sept. 2016, p. 1. EBSCOhost, https://doi.org/10.1142/S0219265916500067.
APA
Huang, Y.-S., Peng, S.-L., & Wu, R.-Y. (2016). An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs. Journal of Interconnection Networks, 16(3/4), 1. https://doi.org/10.1142/S0219265916500067
Chicago
Huang, Yu-Sheng, Sheng-Lung Peng, and Ro-Yu Wu. 2016. “An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs.” Journal of Interconnection Networks 16 (3/4): 1. doi:10.1142/S0219265916500067.