A note on exact distance labeling

• Exact distance‐labels of edge‐weighted undirected graphs. • We show labels of size $O(n)$ with $O({\log }^{*}n)$ query time. • Improving $O(\log \log n)$ query time.