Negative-cycle detection algorithms

  • Boris V. Cherkassky
  • Andrew V. Goldberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)


We study the problem of finding a negative length cycle in a network. An algorithm for the negative cycle problem combines a shortest path algorithm and a cycle detection strategy. We study various combinations of shortest path algorithms and cycle detection strategies and find the best combinations. One of our discoveries is that a cycle detection strategy of Tarjan greatly improves practical performance of a classical shortest path algorithm, making it competitive with the fastest known algorithms on a wide range of problems. As a part of our study, we develop problem families for testing negative cycle algorithms.


Short Path Random Graph Hamiltonian Cycle Input Graph Short Path Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. E. Bellman. On a Routing Problem. Quart. Appl. Math., 16:87–90, 1958.Google Scholar
  2. 2.
    B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 516–525, 1994. To appear in Math. Prog.Google Scholar
  3. 3.
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.Google Scholar
  4. 4.
    G. B. Dantzig. Application of the Simplex Method to a Transportation Problem. In T. C. Koopmans, editor, Activity Analysis and Production and Allocation, pages 359–373. Wiley, New York, 1951.Google Scholar
  5. 5.
    E. V. Denardo and B. L. Fox. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. Oper. Res., 27:161–186, 1979.Google Scholar
  6. 6.
    R. B. Dial, F. Glover, D. Karney, and D. Klingman. A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees. Networks, 9:215–248, 1979.Google Scholar
  7. 7.
    L. Ford. Network Flow Theory. Technical Report P-932, The Rand Corporation, 1956.Google Scholar
  8. 8.
    L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962.Google Scholar
  9. 9.
    G. Gallo and S. Pallottino. Shortest Paths Algorithms. Annals of Oper. Res., 13:3–79, 1988.Google Scholar
  10. 10.
    F. Glover, R. Glover, and D. Klingman. Computational Study of an Improved Shortest Path Algorithm. Networks, 14:25–37, 1984.Google Scholar
  11. 11.
    F. Glover, D. Klingman, and N. Phillips. A New Polynomially Bounded Shortest Paths Algorithm. Oper. Res., 33:65–73, 1985.Google Scholar
  12. 12.
    A. V. Goldberg. Scaling Algorithms for the Shortest Paths Problem. SIAM J. Comput., 24:494–504, 1995.CrossRefGoogle Scholar
  13. 13.
    A. V. Goldberg and T. Radzik. A Heuristic Improvement of the Bellman-Ford Algorithm. Applied Math. Let., 6:3–6, 1993.MathSciNetGoogle Scholar
  14. 14.
    M. S. Hung and J. J. Divoky. A Computational Study of Efficinet Shotest Path Algorithms. Comput. Ops. Res., 15:567–576, 1988.Google Scholar
  15. 15.
    J. L. Kennington and R. V. Helgason. Algorithms for Network Programming. John Wiley and Sons, 1980.Google Scholar
  16. 16.
    M. Klein. A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems. Management Science, 14:205–220, 1967.Google Scholar
  17. 17.
    S.G. Kolliopoulos and C. Stein. Finding Real-Valued Single-Source Shortest Paths in o(n 3) Expected Time. In Proc. 5th Int. Programming and Combinatorial Optimization Conf., 1996.Google Scholar
  18. 18.
    E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York, NY, 1976.Google Scholar
  19. 19.
    B. Ju. Levit and B. N. Livshits. Nelineinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian.Google Scholar
  20. 20.
    J-F. Mondou, T.G. Crainic, and S. Nguyen. Shortest Path Algorithms: A Computational Study with the C Progremming Language. Computers and Oper. Res., 18:767–786, 1991.Google Scholar
  21. 21.
    E. F. Moore. The Shortest Path Through a Maze. In Proc. of the Int. Symp. on the Theory of Switching, pages 285–292. Harvard University Press, 1959.Google Scholar
  22. 22.
    S. Pallottino. Shortest-Path Methods: Complexity, Interrelations and New Propositions. Networks, 14:257–267, 1984.Google Scholar
  23. 23.
    U. Pape. Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem. Math. Prog., 7:212–222, 1974.Google Scholar
  24. 24.
    P. Spirakis and A. Tsakadidis. A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. In Proc. 13th ICALP, Lecture Notes in Computer Science 226, pages 59–67. Springer-Verlag, 1996.Google Scholar
  25. 25.
    R. E. Tarjan. Shortest Paths. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1981.Google Scholar
  26. 26.
    R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Boris V. Cherkassky
    • 1
  • Andrew V. Goldberg
    • 2
  1. 1.Central Economics and Mathematics InstituteMoscowRussia
  2. 2.NEC Research Institute, Inc.Princeton

Personalised recommendations