1 |
L. R. Ford and D. R. Fulkerson, "Maximal Flow Through a Network", Canadian Journal of Mathematics, Vol. 8, No. 1, pp. 399-404, Jan. 1956, doi:10. 1007/978-0-8176-4842-8_15.
DOI
|
2 |
A. Schrijver, "On the History of the Transportation and Maximum Flow Problems", Mathematical Programming, Vol. 91, No. 3, pp. 437-445, Feb. 2002, doi:10.1007/s101070 100259.
DOI
|
3 |
J. Edmonds and R. M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", Journal of the ACM, Vol. 19, No. 2, pp. 248-264, Apr. 1972, doi:10.1145/321694.321699.
DOI
|
4 |
S. U. Lee, "Maximum Capacity-based Minimum Cut Algorithm", Journal of the Korean Society of Computer and Information, Vol. 16, No. 5, pp. 153-162, May 2011, uci:G704-001619.2011.16.5. 004.
DOI
|
5 |
S. U. Lee, "A Bottleneck Search Algorithm for Digraph Using Maximum Adjacency Merging Method", The Institute of Internet, Broadcasting and Communication, Vol. 12, No. 5, pp. 129-139, Oct. 2012, doi:10.7236/JIWIT.2012.12.5.129.
DOI
|