Prefer a chat interface with context about you and your work?
A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
Thorup and Zwick [2001a] proposed a landmark distance oracle with the following properties. Given an n -vertex undirected graph G = ( V , E ) and a parameter k = 1, 2, …, their oracle has size O ( kn 1 + 1/ k ), and upon a query …