Cite
The maximum edge-disjoint paths problem in complete graphs
MLA
Kosowski, Adrian. “The Maximum Edge-Disjoint Paths Problem in Complete Graphs.” Theoretical Computer Science, vol. 399, no. 1/2, June 2008, pp. 128–40. EBSCOhost, https://doi.org/10.1016/j.tcs.2008.02.017.
APA
Kosowski, A. (2008). The maximum edge-disjoint paths problem in complete graphs. Theoretical Computer Science, 399(1/2), 128–140. https://doi.org/10.1016/j.tcs.2008.02.017
Chicago
Kosowski, Adrian. 2008. “The Maximum Edge-Disjoint Paths Problem in Complete Graphs.” Theoretical Computer Science 399 (1/2): 128–40. doi:10.1016/j.tcs.2008.02.017.