Skip to main content
SpringerLink
Log in

Efficient sequential and parallel algorithms for the negative cycle problem

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 834))

Included in the following conference series:

Abstract

We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real edge weights. Its running time ranges from O(n) up to O(n 1.5 log n) as a certain topological measure of G varies from 1 up to Θ(n). Moreover, an efficient CREW PRAM implementation is given. Our algorithm applies also to digraphs whose genus γ is o(n).

Supported by the EEC ESPRIT Basic Research Action No. 7141 (ALCOM II), by the Ministry of Education of Greece and by the NSF grant No. CDA-9211155.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abrahamson, N. Dadoun, D. Kirkpatrick and T. Przytycka, “A Simple Parallel Tree Contraction Algorithm”, J. of Algorithms, 10(1989), pp.287–302.

    Article  Google Scholar 

  2. E. Cohen, “Efficient Parallel Shortest-paths in Digraphs with a Separator Decomposition”, Proc. 5th ACM SPAA, 1993, pp.57–67.

    Google Scholar 

  3. T. Cormen, C. Leiserson and R. Rivest, “Introduction to Algorithms”, MIT Press & McGraw Hill, 1990.

    Google Scholar 

  4. K. Diks, T. Hagerup and W. Rytter, “Optimal Parallel Algorithms for the Recognition and Colouring of Outerplanar Graphs”, Proc. MFCS'89, LNCS 379.

    Google Scholar 

  5. H. Djidjev, “A Linear Algorithm for Partitioning Graphs of Fixed Genus”, SERDICA, Vol.11, 1895, pp.369–387.

    Google Scholar 

  6. H. Djidjev, G. Pantziou and C. Zaroliagis, “Computing Shortest Paths and Distances in Planar Graphs”, in Proc. 18th ICALP, 1991, LNCS 510, pp. 327–339.

    Google Scholar 

  7. P. Erdős and J. Spencer, “Probabilistic Methods in Combinatorics”, Academic Press, 1974.

    Google Scholar 

  8. G.N. Frederickson, “Using Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems”, Proc. 30th IEEE Symp. on FOCS, 1989, pp.448–453.

    Google Scholar 

  9. G.N. Frederickson, “Planar Graph Decomposition and All Pairs Shortest Paths”, J. ACM, Vol.38, No.1, January 1991, pp.162–204.

    Article  Google Scholar 

  10. M. Fredman and R. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms”, JACM, 34(1987), pp. 596–615.

    Article  Google Scholar 

  11. Y. Han, V. Pan and J. Reif, “Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs”, Proc. 4th ACM SPAA, 1992, pp.353–362.

    Google Scholar 

  12. D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, “Hammock-on-Ears Decomposition: A Technique for Parallel and On-line Path Problems”, CTI Technical Report, TR-93.05.22, Patras, 1993.

    Google Scholar 

  13. D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, “Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems”, Proc. 19th MFCS 94, LNCS, to appear.

    Google Scholar 

  14. E.L. Lawler, “Combinatorial Optimization: Networks and Matroids”, Holt, Rinehart and Winston, 1976.

    Google Scholar 

  15. T. Lengauer, “Efficient Algorithms for the Constraint Generation and Intergrated Circuit Layout Compaction”, Proc. 9th WG83, pp.219–230, 1983.

    Google Scholar 

  16. A. Lingas, “Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs”, Proc. SIGAL 90, LNCS 450, pp.447–457, 1990, Springer-Verlag.

    Google Scholar 

  17. D. Maier, “An Efficient Method for Storing Ancestor Information in Trees”, SIAM J. on Comp., Vol.8, N.4, pp.599–618, 1979.

    Google Scholar 

  18. K. Mehlhorn and B. Schmidt, “A Single Source Shortest Path Algorithm for Graphs with Separators”, in Proc. FCT83, LNCS 158, pp.302–309, 1983.

    Google Scholar 

  19. G. Pantziou, P. Spirakis and C. Zaroliagis, “Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs”, BIT 32 (1992), pp.215–236.

    Google Scholar 

  20. C.H. Papadimitriou and K. Steiglitz, “Combinatorial Optimization: Algorithms and Complexity”, Prentice-Hall, 1982.

    Google Scholar 

  21. P. Spirakis and A. Tsakalidis, “A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph”, in Proc. of 13th ICALP, pp. 397–406, 1986.

    Google Scholar 

  22. R.E. Tarjan, “Data Structures and Network Algorithms”, SIAM, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece

    Dimitris Kavvadias, Grammati E. Pantziou, Paul G. Spirakis & Christos D. Zaroliagis

  2. Dept of Mathematics, Patras University, 26500, Patras, Greece

    Dimitris Kavvadias

  3. Dept of Computer Sc. & Eng., Patras University, 26500, Patras, Greece

    Paul G. Spirakis

  4. Dept of Math. & Computer Sc., Dartmouth College, 03755, Hanover, NH, USA

    Grammati E. Pantziou

  5. Max-Planck Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Christos D. Zaroliagis

Authors
  1. Dimitris Kavvadias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grammati E. Pantziou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul G. Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos D. Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kavvadias, D., Pantziou, G.E., Spirakis, P.G., Zaroliagis, C.D. (1994). Efficient sequential and parallel algorithms for the negative cycle problem. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_190

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_190

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation