Skip to main content
SpringerLink
Log in

A birds eye view to path problems

  • Conference paper
  • First Online:
Graphtheoretic Concepts in Computer Science (WG 1980)

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

Included in the following conference series:

  • 164 Accesses

Abstract

The paper surveys the main results which concern path problems and their complexity. The shortest path problem and its general solution techniques are discussed. Generalized path problems are treated and upper and lower complexity bounds presented. Extensive bibliographic notes are given. The paper is intended to expose the state of a theory which is like a paradigm a means for the study of design and analysis of algorithms.

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.

5. References

  1. A.V.Aho, J.E. Hopcroft, J.D.Ullman: Design and Analysis of Computer Algorithms, Addison-Wesley 1974

    Google Scholar 

  2. R.C. Backhouse, B.A. Carré: Regular Algebra Applied to Path-finding Problems, J. Inst.Maths.Applics 15, 1975

    Google Scholar 

  3. P. Bloniarz: A Shortest Path Algorithm with Expected Time O (n2logn log*n), Proc. of the 12th ACM Symp. on Theory of Computing, Los Angeles, 1980

    Google Scholar 

  4. P. Brucker: Theory of Matrix Algorithms, Math. Systems in Economics 13, Anton Hain, 1974

    Google Scholar 

  5. B.A. Carré: An Algebra for Network Routing Problems, J. Inst. Maths. Applics 7, 1971

    Google Scholar 

  6. —: Graphs and Networks, Clarendon Press, Oxford, 1979

    Google Scholar 

  7. N. Christofides: Graph Theory, An Algorithmic Approach, Academic Press, 1975

    Google Scholar 

  8. J.H. Conway: Regular Algebra and Finite Machines, Chapman and Hall, 1971

    Google Scholar 

  9. W. Domschke: Kürzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche, Mathematical Systems in Economics 2, Anton Hain, 1972

    Google Scholar 

  10. N. Deo, C. Pang: Shortest Path Algorithms: Taxonomy and Annotation, Washington State University, CS-80-057, 1980

    Google Scholar 

  11. S.E. Dreyfus: An Appraisal of Some Shortest Path Algorithms, Operations Research, 17, 1969

    Google Scholar 

  12. S. Eilenberg: Automata, Languages and Machines, Vol. A, Academic Press, 1974

    Google Scholar 

  13. M.J. Fischer, A.R. Meyer: Boolean Matrix Multiplication and Transitive Closure, IEEE 12th Ann. Symp. on Switching and Automata Theory, 1971

    Google Scholar 

  14. L.R. Ford: Network Flow Theory, The Rand Corporation, P-923, 1956

    Google Scholar 

  15. M.L. Fredman: New Bounds on the Complexity of the Shortest Path Problem, SIAM J.Comp., Vol.5, 1976

    Google Scholar 

  16. M.E. Furman: Application of a Method of Fast Multiplication of Matrices in the Problem of Finding the Transitive Closure of a Graph, Soviet Math. Dokl. 11:5, 1970

    Google Scholar 

  17. B.L. Golden, T.L. Magnanti: Deterministic Network Optimization — a bibliography, Networks, 7, 1977

    Google Scholar 

  18. M. Gondran, M. Minoux: Graphes et Algorithmes, Eyrolles, Paris, 1979

    Google Scholar 

  19. M. Iri, M. Nakamori: Path Sets, Operator Semigroups and Shortest Path Algorithms on a Network, RAAG, Research Notes, Third Series, No. 185, Univ. Tokyo, 1972

    Google Scholar 

  20. D.B. Johnson: Algorithms for Shortest Paths, TR 73-169, Cornell University, 1973

    Google Scholar 

  21. —: Efficient Algorithms for Shortest Paths in Networks, J. ACM 24, 1977

    Google Scholar 

  22. L.R. Kerr: The Effect of Algebraic Structures on the Computational Complexity of Matrix Multiplication, Ph.D. Thesis, Cornell, 1970

    Google Scholar 

  23. E. Lawler: Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976

    Google Scholar 

  24. D.J. Lehmann: algebraic Structures for Transitive Closure, Theoretical Computer Science 4, 1977

    Google Scholar 

  25. C. Lautemann, B. Mahr: A Note on the Complexity of Path Problems, unpublished, 1980

    Google Scholar 

  26. B. Mahr: Algebraische Komplexität des allgemeinen Wegeproblems in Graphen, Techn. Univ. Berlin, Fachbereich Informatik, 79–14, 1979

    Google Scholar 

  27. —: Semirings and Transitive Closure, in preparation, 1980

    Google Scholar 

  28. K. Mehlhorn: Effiziente Algorithmen, Teubner, 1977

    Google Scholar 

  29. J.D. Murchland: Shortest Distances by a Fixed Matrix Method, Report LBS-TNT-64, London, Graduate School of Business Studies, 1968 (see /Br 74/)

    Google Scholar 

  30. J. Munro: Efficient Determination of the Transitive Closure of a Directed Graph, Information Processing Letters 1:2, 1971

    Google Scholar 

  31. H. Noltemeier: Graphentheorie; mit Algorithmen und Anwendungen, de Gruyter, 1976

    Google Scholar 

  32. M.S. Paterson: Complexity of Matrix Algorithms, handwritten copy, May 1974

    Google Scholar 

  33. U. Pape: Eine Bibliographie zu "kürzeste Wege in Graphen", Techn. Univ. Berlin, FB 20, 1977

    Google Scholar 

  34. A.R. Pierce: Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree and Related Circuit Routing Problems, 1956–1974), Networks 5, 1975

    Google Scholar 

  35. V.R. Pratt: The Power of Negative Thinking in Multiplying Boolean Matrices, SIAM J.Comp. Vol. 4, 1975

    Google Scholar 

  36. A. Salomaa: Theory of Automata, Pergamon Press, Oxford, 1969

    Google Scholar 

  37. R.E. Tarjan: Solving Path Problems on Directed Graphs, Comp. Sci. Dept. Univ. Stanford, 1975

    Google Scholar 

  38. R.A. Wagner: A Shortest Path Algorithm for Edge Sparse Graphs, J. ACM, 23, 1976

    Google Scholar 

  39. A. Wongseelashote: Semirings and Path Spaces, Discrete Math. 26, 1979

    Google Scholar 

  40. U. Zimmermann: Extract of a book submitted for publication, 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik (20) Institut für Software und Theoretische Informatik, Technische Universität Berlin, Otto-Suhr-Allee 18/20, 1000, Berlin 10

    Bernd Mahr

Authors
  1. Bernd Mahr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mahr, B. (1981). A birds eye view to path problems. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-10291-4_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10291-5

  • Online ISBN: 978-3-540-38435-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation