A note on exact distance labeling |
| |
Authors: | Oren Weimann David Peleg |
| |
Affiliation: | The Weizmann Institute of Science, Israel |
| |
Abstract: | We show that the vertices of an edge-weighted undirected graph can be labeled with labels of size O(n) such that the exact distance between any two vertices can be inferred from their labels alone in time. This improves the previous best exact distance labeling scheme that also requires O(n)-sized labels but time to compute the distance. Our scheme is almost optimal as exact distance labeling is known to require labels of length Ω(n). |
| |
Keywords: | Labeling schemes Shortest paths Graph algorithms Distributed systems |
本文献已被 ScienceDirect 等数据库收录! |