Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Flows in Networks;Ford,1962
2. Augmenting graphs to meet edge-connectivity requirements;Frank;SIAM J. Discrete Math.,1992
3. Combinatorial Problems and Exercises;Lovász,1979
4. A reduction method for edge-connectivity in graphs;Mader;Ann. Discrete Math.,1978
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献