- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1435-5914
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Shortest Directed Networks in the Plane ; day:12 ; month:6 ; year:2020 ; pages:1-19
Graphs and combinatorics ; (12.6.2020), 1-19
- Urheber
-
Maxwell, Alastair
Swanepoel, Konrad J.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00373-020-02183-8
- URN
-
urn:nbn:de:101:1-2020081101473031324259
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:56 MESZ
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
- Maxwell, Alastair
- Swanepoel, Konrad J.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Encoding Shortest Paths in Spatial Networks
Shortest path counting in probabilistic biological networks
Towards shortest path identification on large networks
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
Computing shortest safe path amidst growing discs in the plane
Near-shortest path routing in hybrid communication networks
The shortest path problem in the stochastic networks with unstable topology
Simulating SIR processes on networks using weighted shortest paths
Shortest link scheduling in wireless networks under the Rayleigh fading model
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Encoding Shortest Paths in Spatial Networks
Shortest path counting in probabilistic biological networks
Towards shortest path identification on large networks
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
Computing shortest safe path amidst growing discs in the plane
Near-shortest path routing in hybrid communication networks
The shortest path problem in the stochastic networks with unstable topology
Simulating SIR processes on networks using weighted shortest paths
Shortest link scheduling in wireless networks under the Rayleigh fading model
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Encoding Shortest Paths in Spatial Networks
Shortest path counting in probabilistic biological networks
Towards shortest path identification on large networks
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
Computing shortest safe path amidst growing discs in the plane
Near-shortest path routing in hybrid communication networks
The shortest path problem in the stochastic networks with unstable topology
Simulating SIR processes on networks using weighted shortest paths
Shortest link scheduling in wireless networks under the Rayleigh fading model
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks