Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Arikati, S.R., Mehlhorn, K.: A correctness certificate for the Stoer–Wagner min-cut algorithm. Inf. Process. Lett. 70(5), 251–254 (1999)
2. Diestel, R.: Graph Theory, fourth edn. Springer, Berlin (2010)
3. Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507–518 (1975)
4. Frank, A.: On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki. Laboratoire Artemis, IMAG, Université J. Fourier, Grenoble (Mar 1994)
5. Galil, Z.: Finding the vertex connectivity of graphs. SIAM J. Comput. 9(1), 197–199 (1980)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献