Via Detours to I/O-Efficient Shortest Paths
type: Item
instance of: scholarly article
title: Via Detours to I/O-Efficient Shortest Paths
zbMATH Open document ID: 1258.68105
DOI: 10.1007/978-3-642-03456-5_15
author: Ulrich Meyer
published in: Lecture Notes in Computer Science
publication date: 2009-11-12T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5631979
describes a project that uses: STXXL
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-03456-5 15
OpenAlex ID: W1697432253
cites work: A functional approach to external graph algorithms
cites work: Q3056948
cites work: A computational study of external-memory BFS algorithms
cites work: Q2934681
cites work: Automata, Languages and Programming
cites work: On External-Memory Planar Depth First Search
cites work: Algorithm Theory - SWAT 2004
cites work: Q4886043
cites work: External-memory exact and approximate all-pairs shortest-paths in undirected graphs
cites work: Q3619797
cites work: Q4218150
cites work: A note on two problems in connexion with graphs
cites work: Algorithms and Experiments for the Webgraph
cites work: Q4797426
cites work: Cache-Oblivious Algorithms
cites work: Q4796178
cites work: Q4474117
cites work: A Practical Shortest Path Algorithm with Linear Expected Time
cites work: Simpler computation of single-source shortest paths in linear average time
cites work: I/O-Efficient Algorithms on Near-Planar Graphs
cites work: Q4023519
cites work: A Separator Theorem for Planar Graphs
cites work: Fast computation of empirically tight bounds for the diameter of massive graphs
cites work: I/O-Efficient Planar Separators
cites work: Q4411404
cites work: External memory BFS on undirected graphs with bounded degree.
cites work: Q4910749
cites work: On Trade-Offs in External-Memory Diameter-Approximation
cites work: Algorithms - ESA 2003
cites work: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
cites work: Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
cites work: Δ-stepping: a parallelizable shortest path algorithm
cites work: Q4252349
cites work: Parallel Algorithms for Depth-First Searches I. Planar Graphs
description: scientific article