Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,General Mathematics
Reference14 articles.
1. G. B. Dantzig andD. R. Fulkerson, On the max-flow min-cut theorem of networks, Linear Inequalities and Related Systems,Annals of Math. Study,38 (1956), S. 215–221.
2. R. P. Dilworth, A decomposition theorem for partially ordered sets,Annals of Math.,51 (1950), S. 161–166.
3. J. Egerváry, Matrixok kombinatorikus tulajdonságairól,Mat. és Fiz. Lapok,38 (1931), S. 16–27.
4. L. R. Ford, Jr. andD. R. Fulkerson, Maximal flow through a network,Canadian Journal of Math.,8 (1956), S. 399–404.
5. L. R. Ford, Jr. andD. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem,Canadian Journal of Math.,9 (1957), S. 210–218.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Matroids and Combinatorial Optimisation;Matroid Theory and its Applications;2010
2. Generalizing the all-pairs min cut problem;Discrete Mathematics;1995-12
3. Introduction;Graphs and Order;1985
4. Tibor Gallai;Combinatorica;1982-09
5. Matroids and Multicommodity Flows;European Journal of Combinatorics;1981-09