Forbidden-set distance labels for graphs of bounded doubling dimension
Publication:5176198
DOI10.1145/1835698.1835743zbMath1315.68196OpenAlexW2142266972MaRDI QIDQ5176198
Ittai Abraham, Cyril Gavoille, Shiri Chechik, David Peleg
Publication date: 2 March 2015
Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1835698.1835743
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)
Related Items (2)
Uses Software
Cites Work
This page was built for publication: Forbidden-set distance labels for graphs of bounded doubling dimension