Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Spanning trees in specialized network flow problems
Spanning trees in specialized network flow problems
Computational Comparison of Eight Methods for the Maximum Network Flow Problem
ACM Transactions on Mathematical Software (TOMS)
Hi-index | 0.00 |