Disjoint paths in a network
暂无分享,去创建一个
[1] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[4] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[5] I. Frisch. An Algorithm for Vertex-pair Connectivity , 1967 .
[6] Kenneth Steiglitz,et al. A new derivation of Frisch's algorithm for calculating vertex-pair connectivity , 1971 .
[7] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.