APA (7th ed.) Citation

Yu, C., Lin, C., & Wang, B. (2010). Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. Journal of computer and system sciences, 76(8), 697-708. https://doi.org/10.1016/j.jcss.2010.01.013

Chicago Style (17th ed.) Citation

Yu, Chih-Chiang, Chien-Hsin Lin, and Biing-Feng Wang. "Improved Algorithms for Finding Length-bounded Two Vertex-disjoint Paths in a Planar Graph and Minmax K Vertex-disjoint Paths in a Directed Acyclic Graph." Journal of Computer and System Sciences 76, no. 8 (2010): 697-708. https://doi.org/10.1016/j.jcss.2010.01.013.

MLA (9th ed.) Citation

Yu, Chih-Chiang, et al. "Improved Algorithms for Finding Length-bounded Two Vertex-disjoint Paths in a Planar Graph and Minmax K Vertex-disjoint Paths in a Directed Acyclic Graph." Journal of Computer and System Sciences, vol. 76, no. 8, 2010, pp. 697-708, https://doi.org/10.1016/j.jcss.2010.01.013.