A Minimum 3-Connectivity Augmentation of a Graph
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Toshimasa Watanabe. An Efficient Way for Edge-Connectivity Augmentation. , 1987 .
[3] Arnie Rosenthal,et al. Smallest Augmentations to Biconnect a Graph , 1977, SIAM J. Comput..
[4] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..
[5] W. T. Tutte. Connectivity in graphs , 1966 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Akira Nakamura,et al. A smallest augmentation to 3-connect a graph , 1990, Discret. Appl. Math..
[8] A. Nakamura,et al. 3-connectivity augmentation problems , 1988, 1988., IEEE International Symposium on Circuits and Systems.
[9] Shimon Even,et al. Graph Algorithms , 1979 .
[10] A. Nakamura,et al. 3-edge-connectivity augmentation problems , 1989, IEEE International Symposium on Circuits and Systems,.
[11] H. Frank,et al. Connectivity considerations in the design of survivable networks , 1970 .
[12] Akira Nakamura,et al. Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..
[13] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..