Monografie
Design and analysis of sequential and parallel single-source shortest paths algorithms
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2002
- Identifier
-
97232271X
- Thema
-
Kürzester-Weg-Problem ; Average-case-Komplexität ; Sequenzieller Algorithmus ; Paralleler Algorithmus ; Kürzester-Weg-Problem ; Average-case-Komplexität ; Sequentieller Algorithmus ; Paralleler Algorithmus; Hochschulschrift; Online-Publikation
- Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:58 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Monografie
Beteiligte
Ähnliche Objekte (12)
Universal Shortest Paths
Shortest Paths II
Engineering shortest paths and layout algorithms for large graphs
Computing shortest paths in series parallel graphs in logarithmic space
Shortest Paths for Line Segments
Timetable information and shortest paths
Shortest Paths III / Network Flows
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
Constrained shortest paths and related problems
Encoding Shortest Paths in Spatial Networks
Average-case complexity of shortest-paths problems
Universal Shortest Paths
Shortest Paths II
Engineering shortest paths and layout algorithms for large graphs
Computing shortest paths in series parallel graphs in logarithmic space
Shortest Paths for Line Segments
Timetable information and shortest paths
Shortest Paths III / Network Flows
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
Constrained shortest paths and related problems
Encoding Shortest Paths in Spatial Networks
Average-case complexity of shortest-paths problems
Universal Shortest Paths
Shortest Paths II
Engineering shortest paths and layout algorithms for large graphs
Computing shortest paths in series parallel graphs in logarithmic space
Shortest Paths for Line Segments
Timetable information and shortest paths
Shortest Paths III / Network Flows
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
Constrained shortest paths and related problems
Encoding Shortest Paths in Spatial Networks