Advertisement

Zusammenfassung

Wir betrachten einen Graphen G mit den Knoten P1, ..., Pn und stellen uns die Aufgabe, einen Weg von einem Knoten Pa von G zu einem Knoten Pe von G zu finden.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [49]
    Pollack, M., Wiebènson, W.: Solutions of the shortest-route problem. — A review. Operations Res. 8, 224–230 (1960).CrossRefGoogle Scholar
  2. [37]
    Hu, T. C.: A decomposition algorithm for shortest paths in a network. Operations Res. 16, 91–102 (1968).CrossRefGoogle Scholar
  3. [38]
    Klee, V.: A `string algorithm’ for shortest path in directed networks. Operations Res. 12, 428–432 (1964).CrossRefGoogle Scholar
  4. [18]
    Dijkstra, E. W.: Some theorems on spanning subtrees of a graph. Proceedings Amsterdam 22, 196–199 (1960).Google Scholar
  5. [28]
    Gordon, R. M.: Checking for loops in networks. Comm. ACM 6, 384 (1963).CrossRefGoogle Scholar
  6. [57]
    Dreyfus, S. E.: An Appraisal of some shortest-path algorithms. Operations Res. 17, 395–412 (1969).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1969

Authors and Affiliations

  • Walter Knödel
    • 1
  1. 1.Technischen UniversitätStuttgartDeutschland

Personalised recommendations