On Trade-Offs in External-Memory Diameter-Approximation

DOI10.1007/978-3-540-69903-3_38zbMath1155.68477OpenAlexW1804827942MaRDI QIDQ3512478

Ulrich Meyer

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_38

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Via Detours to I/O-Efficient Shortest Paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Euler tours in parallel
• A functional approach to external graph algorithms
• Algorithms for memory hierarchies. Advanced lectures
• Fast and Simple Approximation of the Diameter and Radius of a Graph
• Fast computation of empirically tight bounds for the diameter of massive graphs
• Automata, Languages and Programming
• Algorithms - ESA 2003