Hochschulschrift | Online-Publikation
Design and analysis of sequential and parallel single-source shortest paths algorithms
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2002
- Klassifikation
-
Informatik
- Schlagwort
-
Kürzester-Weg-Problem
Average-case-Komplexität
Sequenzieller Algorithmus
Paralleler Algorithmus
Kürzester-Weg-Problem ; Average-case-Komplexität ; Sequentieller Algorithmus ; Paralleler Algorithmus
- Urheber
- URN
-
urn:nbn:de:bsz:291-scidok-2076
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:39 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek.
Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
- Online-Publikation
Beteiligte
Ähnliche Objekte (12)
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
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
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
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
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
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
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
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
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Timetable information and shortest paths