I/O-efficient hierarchical diameter approximation

DOI10.1007/978-3-642-33090-2_8MaRDI QIDQ2912827zbMATH OpenOpenAlexFDO

Authors Deepak Ajwani, Ulrich Meyer, David Veith

Publication date 25 September 2012

Published in Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10197/9897

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• On Trade-Offs in External-Memory Diameter-Approximation
• Computing giant graph diameters
• External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs
• Fast approximation algorithms for the diameter and radius of sparse graphs
• Fast and Simple Approximation of the Diameter and Radius of a Graph

Cited in

(3)

• On Trade-Offs in External-Memory Diameter-Approximation
• I/O-efficient algorithms for CDBs
• Hierarchical Heavy Hitters with the Space Saving Algorithm

This page was built for publication: I/O-efficient hierarchical diameter approximation

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