1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: theory, Algorithms and Applications, Prentice-Hall, Englewood Cliff, NY, 1993.
2. Lexicographic bottleneck problems;Burkard;Operations Research Letters,1991
3. Algorithm 360: shortest path forest with topological ordering;Dial;Comm. ACM,1696
4. Scaling algorithms for network flows;Gabow;J. of Comp. System Sci.,1985
5. H.N. Gabow, Data structures for weighted matchings and nearest common ancestors with linking, Proc. 1st ACM–SIAM Symp. on Discrete Algorithms, 1990, pp. 434–443.