Author:
Brim Luboš,Černá Ivana,Krčál Pavel,Pelánek Radek
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Appl. Math., 65:21–46, 1996.
2. S. Chaudhuri and C. D. Zaroliagis. Shortest path queries in digraphs of smalltreewidth. In Automata, Languages and Programming, pages 244–255, 1995.
3. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. MathematicalProgramming, Springer-Verlag, 85:277–311, 1999.
4. E. Cohen. Efficient parallel shortest-paths in digraphs with a separator decomposition.Journal of Algorithms, 21(2):331–357, 1996.
5. T. H. Cormen, Ch. E. Leiserson, and R. L. Rivest. Introduction to Algorithms.MIT, 1990.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献