On Trade-Offs in External-Memory Diameter-Approximation

DOI10.1007/978-3-540-69903-3_38MaRDI QIDQ3512478zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• I/O-efficient hierarchical diameter approximation
• Automata, Languages and Programming
• Computing giant graph diameters
• A computational study of external-memory BFS algorithms
• Fast and Simple Approximation of the Diameter and Radius of a Graph

Cites work

• A functional approach to external graph algorithms
• Algorithms for memory hierarchies. Advanced lectures
• Automata, Languages and Programming
• External-memory exact and approximate all-pairs shortest-paths in undirected graphs
• Fast and Simple Approximation of the Diameter and Radius of a Graph
• Fast computation of empirically tight bounds for the diameter of massive graphs
• Finding Euler tours in parallel
• scientific article; zbMATH DE number 1617278 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1305462 (Why is no real title available?)
• scientific article; zbMATH DE number 1947435 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• scientific article; zbMATH DE number 1445387 (Why is no real title available?)
• I/O-efficient undirected shortest paths

Cited in

(2)

• I/O-efficient hierarchical diameter approximation
• Via Detours to I/O-Efficient Shortest Paths

This page was built for publication: On Trade-Offs in External-Memory Diameter-Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512478)