Author:
Radzik Tomasz,Goldberg Andrew V.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference32 articles.
1. R. K. Ahuja, A. V. Goldberg, J. B. Orlin, and R. E. Tarjan. Finding Minimum-Cost Flows by Double Scaling. Technical Report STAN-CS-88-1227, Department of Computer Science, Stanford University, 1988.
2. R. G. Busacker and T. L. Saaty.Finite Graphs and Networks: An Introduction with Applications. McGraw-Hill, New York, 1965.
3. W. Chi and S. Fujishige. A Primal Algorithm for the Submodular Flow Problem with Minimum-Mean Cycle Selection. Technical Report 350, University of Tsukuba, 1987.
4. J. Edmonds and R. M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.J. Assoc. Comput. Mach., 19:248?264, 1972.
5. G. M. Engel and H. Schneider. Diagonal Similarity and Equivalence for Matrices Over Groups with O.Czech. Math. J., 25:389?403, 1975.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献