1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1993
2. Banerjee, S., Saxena, S.: Parallel algorithm for finding the most vital edge in weighted graphs. J. Parallel Dist. Comput. 46, 101?104 (1997)
3. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital edges and nodes. Technical Report CS-TR-3539, University of Maryland Institute for Advanced Studies, College Park, 1995
4. Booth, H., Westbrook, J.: A linear algorithm for analysis of minimum spanning and shortest path trees of planar graphs. Algorithmica 11, 341?352 (1994)
5. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248?264 (1972)