Reconstructing approximate tree metrics
Publication:5401392
DOI10.1145/1281100.1281110zbMath1283.05076OpenAlexW2142420687MaRDI QIDQ5401392
Fabian Kuhn, Dahlia Malkhi, Kunal Talwar, Mahesh Balakrishnan, Ittai Abraham, Venugopalan Ramasubramanian
Publication date: 13 March 2014
Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1281100.1281110
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Internet topics (68M11)
Related Items
This page was built for publication: Reconstructing approximate tree metrics