Hochschulschrift
Design and analysis of sequential and parallel single-source shortest paths algorithms
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
VIII, 110 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Saarbrücken, Univ., Diss., 2002
- 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
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 11:38 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
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Design and analysis of sequential and parallel single-source shortest paths algorithms
Timetable information and shortest paths
Universal Shortest Paths
Shortest Paths II
Constrained shortest paths and related problems
Constrained shortest paths and related problems
Computing shortest paths in series parallel graphs in logarithmic space
Theory and engineering for shortest paths and delay management
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Shortest Paths III / Network Flows
Shortest paths and Steiner trees in VLSI routing
Design and analysis of sequential and parallel single-source shortest paths algorithms
Timetable information and shortest paths
Universal Shortest Paths
Shortest Paths II
Constrained shortest paths and related problems
Constrained shortest paths and related problems
Computing shortest paths in series parallel graphs in logarithmic space
Theory and engineering for shortest paths and delay management
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Shortest Paths III / Network Flows
Shortest paths and Steiner trees in VLSI routing
Design and analysis of sequential and parallel single-source shortest paths algorithms
Timetable information and shortest paths
Universal Shortest Paths
Shortest Paths II
Constrained shortest paths and related problems
Constrained shortest paths and related problems
Computing shortest paths in series parallel graphs in logarithmic space
Theory and engineering for shortest paths and delay management
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Shortest Paths III / Network Flows