I/O-efficient Hierarchical Diameter Approximation

From MaRDI portal

Revision as of 20:12, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2912827

Jump to:navigation, search

DOI10.1007/978-3-642-33090-2_8zbMath1365.68463OpenAlexW1896986493MaRDI QIDQ2912827

David Veith, Deepak Ajwani, Ulrich Meyer

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) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: I/O-efficient Hierarchical Diameter Approximation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2912827&oldid=15880748"