Author:
Basavaraju Manu,Fomin Fedor V.,Golovach Petr,Misra Pranabendu,Ramanujan M. S.,Saurabh Saket
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lecture Notes in Computer Science;H.L. Bodlaender,2013
2. Dinits, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in graphs. In: Fridman, A. (ed.) Studies in Discrete Mathematics, Nauka, Moscow, pp. 290–306 (1976)
3. Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks 1(3), 195–207 (1971)
4. Eswaran, K., Tarjan, R.: Augmentation problems. SIAM Journal on Computing 5(4), 653–665 (1976)
5. Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Mathematics 5(1), 25–53 (1992)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献