Abe, J. O. Et Al. 2014. k-Maximally Disjoint Path Routing Algorithms for SDN. 6th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) , (Shanghai, China), 499-508.

Abe, J. O., MANTAR, H. A., & Yayımlı, A., (2014). k-Maximally Disjoint Path Routing Algorithms for SDN . 6th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) (pp.499-508). Shanghai, China

Abe, John, HACI ALİ MANTAR, And Ayşegül Yayımlı. "k-Maximally Disjoint Path Routing Algorithms for SDN," 6th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Shanghai, China, 2014

Abe, John O. Et Al. "k-Maximally Disjoint Path Routing Algorithms for SDN." 6th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) , Shanghai, China, pp.499-508, 2014

Abe, J. O. MANTAR, H. A. And Yayımlı, A. (2014) . "k-Maximally Disjoint Path Routing Algorithms for SDN." 6th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) , Shanghai, China, pp.499-508.

@conferencepaper{conferencepaper, author={John Olorunfemi Abe Et Al. }, title={k-Maximally Disjoint Path Routing Algorithms for SDN}, congress name={6th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)}, city={Shanghai}, country={China}, year={2014}, pages={499-508} }