- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
VIII, 78 S.
- Language
-
Englisch
- Notes
-
Saarbrücken, Univ., Diss., 2001
- Keyword
-
Kürzester-Weg-Problem
Average-case-Komplexität
Kürzester-Weg-Problem ; Average-case-Komplexität
- Creator
-
Priebe, Volker
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:44 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Priebe, Volker
Other Objects (12)
Average-case complexity of shortest-paths problems
Shortest Paths II
Universal Shortest Paths
Structural average case complexity
k-shortest path: average-case analysis and practical improvements
Structure in average case complexity
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Average-case complexity of shortest-paths problems
Shortest Paths II
Universal Shortest Paths
Structural average case complexity
k-shortest path: average-case analysis and practical improvements
Structure in average case complexity
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Average-case complexity of shortest-paths problems
Shortest Paths II
Universal Shortest Paths
Structural average case complexity
k-shortest path: average-case analysis and practical improvements
Structure in average case complexity
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Drawing Shortest Paths in Geodetic Graphs