Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,General Computer Science
Reference9 articles.
1. W. H. Cunningham, ?Optimal attack and reinforcement of a network,? J. ACM,32, 549?561 (1985).
2. D. Gusfeld, ?Connectivity and edge disjoint spanning trees,? Inform. Proc. Lett.,16, 87?89 (1983).
3. J. Edmonds, ?Min partition of a matroid into independent subsets,? J. Res. Nat. Bureau Stand.,B 69, 65?72 (1965).
4. G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
5. A. V. Goldberg and R. E. Tarjan, ?A new approach to the maximum flow problem,? J. ACM,35, 921?940 (1988).