An external memory data structure for shortest path queries
type: Item
instance of: scholarly article
title: An external memory data structure for shortest path queries
zbMATH Open document ID: 1011.68022
DOI: 10.1016/S0166-218X(02)00217-2
author: Yanyan Li
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1878528
zbMATH Keywords: external-memory algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: shortest paths
zbMATH Keywords: planar graphs
MaRDI profile type: Publication
cites work: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
cites work: The buffer tree: A new technique for optimal I/O-algorithms
cites work: Q4886043
cites work: Efficient external memory algorithms by simulating coarse-grained parallel algorithms
cites work: A note on two problems in connexion with graphs
cites work: Edge Separators of Planar and Outerplanar Graphs With Applications
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Planar graph decomposition and all pairs shortest paths
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Faster shortest-path algorithms for planar graphs
cites work: Approximating shortest paths on weighted polyhedral surfaces
cites work: A Separator Theorem for Planar Graphs
cites work: Q4511234
cites work: Q4252349
cites work: Blocking for external graph searching
cites work: Q3992847
cites work: Q4552049
cites work: Algorithms for parallel memory, I: Two-level memories
cites work: Algorithms for parallel memory. II: Hierarchical multilevel memories
full work available at URL: s0166-218x(02)00217-2
OpenAlex ID: W2140883685
description: scientific article; zbMATH DE number 1878528