Author:
Feofiloff P.,Younger D. H.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. J. Edmonds, Edge-disjoint branchings, in:Combinatorial Algorithms, (R. Rustin, ed.) Algorithmics Press, New York, 1973, 91–96.
2. J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs,in: Studies in integer programming (P. L. Hammer, et al, eds.) Annals of Discrete Math.1 (1977), 185–204.
3. R. P. Gupta, A decomposition theorem for bipartite graphs, in:Theory of Graphs (P. Rosenstiehl, ed.) Gordon and Breach, New York, 1967, 135–138.
4. L. Lovász, On two minimax theorems in graph theory,J. Combinatorial Theory (B) 21 (1976), 96–103.
5. C. L. Lucchesi andD. H. Younger, A minimax relation for directed graphs,J. London Math. Soc. (2) 17 (1978), 369–374.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献