Edge-Connectivity Augmentation Problems
暂无分享,去创建一个
[1] W. Mader. A Reduction Method for Edge-Connectivity in Graphs , 1978 .
[2] Frank Harary,et al. Graph Theory , 2016 .
[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[4] Yoji Kajitani,et al. The minimum augmentation of a directed tree to a k-edge-connected directed graph , 1986, Networks.
[5] Toshimitsu Masuzawa,et al. The K-node connectivity augmentation problem for directed binary trees , 1984 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Arnie Rosenthal,et al. Smallest Augmentations to Biconnect a Graph , 1977, SIAM J. Comput..
[8] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[9] H. Frank,et al. Connectivity considerations in the design of survivable networks , 1970 .
[10] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[11] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[12] Shimon Even,et al. Graph Algorithms , 1979 .
[13] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .