A faster algorithm for finding the minimum cut in a graph
暂无分享,去创建一个
[1] Toshihide Ibaraki,et al. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..
[2] Giovanni Rinaldi,et al. An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..
[3] Ulrich Derigs,et al. Implementing Goldberg's max-flow-algorithm — A computational investigation , 1989, ZOR Methods Model. Oper. Res..
[4] S. Levialdi,et al. Finding the Edge , 1981 .
[5] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[6] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[7] Robert E. Tarjan,et al. Improved Algorithms for Bipartite Network Flow , 1994, SIAM J. Comput..
[8] S. N. Maheshwari,et al. Analysis of Preflow Push Algorithms for Maximum Network Flow , 1988, SIAM J. Comput..
[9] Baruch Schieber,et al. Finding the Edge Connectivity of Directed Graphs , 1989, J. Algorithms.
[10] J. Picard,et al. Selected Applications of Minimum Cuts in Networks , 1982 .
[11] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[12] David W. Matula,et al. Determining edge connectivity in 0(nm) , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).