Author:
Faigle Ulrich,Kern Walter,Peis Britta
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Borradaile, G., Klein, P.: An O(nlogn) algorithm for maximum st-flow in a directed planar graph. In: SODA 2006 Proceedings, pp. 524–533 (2006)
2. Hoffman, A.J.: On greedy algorithms for series parallel graphs. Math. Progr. 40, 197–204 (1988)
3. Hoffman, A.J.: On greedy algorithms that succeed. In: Anderson, I. (ed.) Surveys in Combinatorics, pp. 97–112. Cambridge Univ. Press, Cambridge (1985)
4. Hoffman, A.J., Kolen, A.W.J., Sakarovitch, M.: Totally balanced and greedy matrices. SIAM Journal Alg. Discr. Methods 6, 721–730 (1985)
5. Faigle, U., Hoffman, A.J., Kern, W.: A characterization of non-negative greedy matrices. SIAM Journal on Discrete Mathematics 9, 1–6 (1996)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献