Engineering multilevel overlay graphs for shortest-path queries

  title={Engineering multilevel overlay graphs for shortest-path queries},
  author={Martin Holzer and Frank Schulz and Dorothea Wagner},
  journal={ACM Journal of Experimental Algorithmics},
An overlay graph of a given graph G = (V, E) on a subset S ⊆ V is a graph with vertex set S and edges corresponding to shortest paths in G. In particular, we consider variations of the multilevel overlay graph used in Schulz et al. [2002] to speed up shortest-path computation. In this work, we follow up and present several vertex selection criteria, along with two general strategies of applying these criteria, to determine a subset S of a graph's vertices. The main contribution is a systematic… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 53 extracted citations

86 Citations

Citations per Year
Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-3 of 3 references

A note on two problems in connexion with graphs

E. W. Dijkstra
Numerische Mathematik, 1 • 1959
View 2 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…