- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Local Routing in Sparse and Lightweight Geometric Graphs ; volume:84 ; number:5 ; day:25 ; month:1 ; year:2022 ; pages:1316-1340 ; date:5.2022
Algorithmica ; 84, Heft 5 (25.1.2022), 1316-1340, 5.2022
- Creator
-
Ashvinkumar, Vikrant
Gudmundsson, Joachim
Levcopoulos, Christos
Nilsson, Bengt J.
Renssen, André van
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-00930-2
- URN
-
urn:nbn:de:101:1-2022070819125384926161
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:40 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ashvinkumar, Vikrant
- Gudmundsson, Joachim
- Levcopoulos, Christos
- Nilsson, Bengt J.
- Renssen, André van
- SpringerLink (Online service)
Other Objects (12)
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Lightweight paths in graphs
Random perturbation of sparse graphs
Linear Orderings of Sparse Graphs
INFERRING ROUTING PREFERENCES OF BICYCLISTS FROM SPARSE SETS OF TRAJECTORIES
Graph decomposition in routing and compilers
Graph Embeddings Motivated by Greedy Routing
Graph theory and sparse matrix computation
Sparse graphs and an augmentation problem
The bandwidth theorem in sparse graphs
Neural 3D reconstruction from sparse views using geometric priors
GraphZIP: a clique-based sparse graph compression method
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Lightweight paths in graphs
Random perturbation of sparse graphs
Linear Orderings of Sparse Graphs
INFERRING ROUTING PREFERENCES OF BICYCLISTS FROM SPARSE SETS OF TRAJECTORIES
Graph decomposition in routing and compilers
Graph Embeddings Motivated by Greedy Routing
Graph theory and sparse matrix computation
Sparse graphs and an augmentation problem
The bandwidth theorem in sparse graphs
Neural 3D reconstruction from sparse views using geometric priors
GraphZIP: a clique-based sparse graph compression method
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Lightweight paths in graphs
Random perturbation of sparse graphs
Linear Orderings of Sparse Graphs
INFERRING ROUTING PREFERENCES OF BICYCLISTS FROM SPARSE SETS OF TRAJECTORIES
Graph decomposition in routing and compilers
Graph Embeddings Motivated by Greedy Routing
Graph theory and sparse matrix computation
Sparse graphs and an augmentation problem
The bandwidth theorem in sparse graphs
Neural 3D reconstruction from sparse views using geometric priors