- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Frankfurt am Main, Johann Wolfgang Goethe-Universität, Dissertation, 2023
- Schlagwort
-
Algorithmus
Pfadanalyse
Analysis
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2023
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.21248/gups.78731
- URN
-
urn:nbn:de:hebis:30:3-787318
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 11:03 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek.
Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Schickedanz, Alexander
- Meyer, Ulrich
- Ajwani, Deepak
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2023
Ähnliche Objekte (12)
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games