APA (7th ed.) Citation

Abe, J. O., Mantar, H. A., & Yayimli, A. G. (2015, September). k -Maximally Disjoint Path Routing Algorithms for SDN. 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 499-508. https://doi.org/10.1109/CyberC.2015.45

Chicago Style (17th ed.) Citation

Abe, John Olorunfemi, Haci Ali Mantar, and Aysegul Gencata Yayimli. "K -Maximally Disjoint Path Routing Algorithms for SDN." 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Sep. 2015: 499-508. https://doi.org/10.1109/CyberC.2015.45.

MLA (9th ed.) Citation

Abe, John Olorunfemi, et al. "K -Maximally Disjoint Path Routing Algorithms for SDN." 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, Sep. 2015, pp. 499-508, https://doi.org/10.1109/CyberC.2015.45.