Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference4 articles.
1. K. Bérczi and A. Frank: Variations for Lovász’ submodular ideas, Technical Report TR-2008-7, The Egerváry Research Group on Combinatorial Optimization (June 2008).
2. J. Edmonds: Edge-disjoint branchings, in: Combinatorial Algorithms (B. Rustin, ed.), Academic Press, 1973, pp. 91–96.
3. N. Kamiyama, N. Katoh and A. Takizawa: Arc-disjoint in-trees in directed graphs, Combinatorica 29(2) (2009), 197–214.
4. A. Schrijver: Combinatorial Optimization — Polyhedra and Efficiency, Springer, 2003.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献