Hochschulschrift
Design and analysis of sequential and parallel single-source shortest paths algorithms
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
VIII, 110 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Saarbrücken, Univ., Diss., 2002
- Keyword
-
Kürzester-Weg-Problem
Average-case-Komplexität
Sequenzieller Algorithmus
Paralleler Algorithmus
Kürzester-Weg-Problem ; Average-case-Komplexität ; Sequentieller Algorithmus ; Paralleler Algorithmus
- Creator
- 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:49 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
Other Objects (12)
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
Universal Shortest Paths
Engineering shortest paths and layout algorithms for large graphs
Computing shortest paths in series parallel graphs in logarithmic space
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Timetable information and shortest paths
Reconfiguring Shortest Paths in Graphs
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Graph algorithms and population protocols: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
Universal Shortest Paths
Engineering shortest paths and layout algorithms for large graphs
Computing shortest paths in series parallel graphs in logarithmic space
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Timetable information and shortest paths
Reconfiguring Shortest Paths in Graphs
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Graph algorithms and population protocols: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
Universal Shortest Paths
Engineering shortest paths and layout algorithms for large graphs
Computing shortest paths in series parallel graphs in logarithmic space
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Timetable information and shortest paths
Reconfiguring Shortest Paths in Graphs
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap