Author:
Arkin Esther M.,Silverberg Ellen B.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. A note on two problems in connexion with graphs;Dijkstra;Numer. Math.,1959
2. Theoretical improvements in algorithmic efficiency for network flow problems;Edmonds;J. Assoc. Comput. Mach.,1972
3. On chain and antichain families of a partially ordered set;Frank;J. Combin. Theory, (Ser. B),1980
4. Fibonacci heaps and their uses in improved network optimization algorithms;Fredman,1984
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
Cited by
227 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献