Optimum Communication Spanning Trees
暂无分享,去创建一个
[1] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[3] R. Prim. Shortest connection networks and some generalizations , 1957 .
[4] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.
[5] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[6] D. Adolphson. Optimal linear-ordering. , 1973 .
[7] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[8] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .