- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Karlsruhe, Univ., Diss., 2005
- Klassifikation
-
Informatik
- Schlagwort
-
Kürzester-Weg-Problem
Graphenzeichnen
- Urheber
-
Willhalm, Thomas
- URN
-
urn:nbn:de:swb:90-33855
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 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.
Beteiligte
- Willhalm, Thomas
Ähnliche Objekte (12)
Shortest Paths II
Universal Shortest Paths
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
Design and analysis of sequential and parallel single-source shortest paths algorithms
Design and analysis of sequential and parallel single-source shortest paths algorithms
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
Shortest edge disjoint paths in graphs
Drawing Shortest Paths in Geodetic Graphs
Shortest Paths II
Universal Shortest Paths
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
Design and analysis of sequential and parallel single-source shortest paths algorithms
Design and analysis of sequential and parallel single-source shortest paths algorithms
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
Shortest edge disjoint paths in graphs
Drawing Shortest Paths in Geodetic Graphs
Shortest Paths II
Universal Shortest Paths
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
Design and analysis of sequential and parallel single-source shortest paths algorithms
Design and analysis of sequential and parallel single-source shortest paths algorithms
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
Shortest edge disjoint paths in graphs