Reconstructing approximate tree metrics
DOI10.1145/1281100.1281110zbMath1283.05076MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
68M11: Internet topics
Related Items