Improved embeddings of graph metrics into random trees

DOI10.1145/1109557.1109565MaRDI QIDQ3581573zbMATH OpenOpenAlexFDO

Authors Kedar Dhamdhere, Anupam Gupta, Harald Räcke

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109565

Mathematics Subject Classification ID

Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80)

Cited in

(2)

• Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
• Low distortion Delaunay embedding of trees in hyperbolic plane

This page was built for publication: Improved embeddings of graph metrics into random trees

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