Author:
Subramani K.,Kovalchick L.
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Lect Notes Comput Sci;B. V. Cherkassky,1996
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992.
3. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49: 61–95, 1991.
4. Andrew V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24(3):494–504, June 1995.
5. W. Pugh. The omega test: A fast and practical integer programming algorithm for dependence analysis. Comm. of the ACM, 35(8):102–114, August1992.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献