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.
Cite
CITATION STYLE
Mahr, B. (1981). A birds eye view to path problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 100 LNCS, pp. 335–353). Springer Verlag. https://doi.org/10.1007/3-540-10291-4_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
