Author:
Yano Hiroki,Miwa Hiroyoshi
Publisher
Springer International Publishing
Reference9 articles.
1. Frank, A.: Augmenting graphs to meet edge-connectivity requirements. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, St. Louis, 22–24 October 1990
2. Ishii, T., Hagiwara, M.: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discrete Appl. Math. 154(16), 2307–2329 (2006)
3. Lecture Notes in Computer Science;G Kortsarz,2002
4. Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graph. Comput. Oper. Res. 36(7), 2193–2200 (2009)
5. Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of ICOIN 2013, Bangkok, 28–30 January 2013