Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Dinic, E. A., Karzanov, A. V. and Lomonosov, M. V.: On the structure of the system of minimum edge cuts in a graph. In Studies in Discrete Optimization, A. A. Fridman (Ed.), Nauka, Moscow, 1976, 290–306 (in Russian)
2. Gabow, H.N.: Application of a poset representation to edge connectivity and graph rigidity. Proc. 32st Annual Symp. on Foundations of Computer Science, 1991, 812–820
3. Galil, Z., and Italiano, G. F.: Fully dynamic algorithms for edge connectivity problems. Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991, 317–327
4. Galil, Z. and Italiano, G. F.: Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput., to appear
5. Hopcroft, J., and Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135–158
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献