Partitioning graphs to speedup Dijkstra's algorithm

@article{Mhring2005PartitioningGT,
  title={Partitioning graphs to speedup Dijkstra's algorithm},
  author={Rolf H. M{\"o}hring and Heiko Schilling and Birk Sch{\"u}tz and Dorothea Wagner and Thomas Willhalm},
  journal={ACM Journal of Experimental Algorithmics},
  year={2005},
  volume={11}
}
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag approach and is based on Dijkstra's algorithm. In the arc-flag approach, we allow a preprocessing of the network data to generate additional information, which is then used to speedup shortest-path queries. In the preprocessing phase, the graph is divided into regions and information is gathered on… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 74 CITATIONS, ESTIMATED 25% COVERAGE

FILTER CITATIONS BY YEAR

2008
2018

CITATION STATISTICS

  • 8 Highly Influenced Citations

  • Averaged 7 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

A note on two problems in connexion with graphs

  • E. W. DIJKSTRA
  • Numerische Mathematik. Vol. 1. Mathematisch…
  • 1959
Highly Influential
8 Excerpts

Efficient algorithms for shortest paths in sparse networks

  • D. B. JOHNSON
  • Journal of the Association for Computing…
  • 1977
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…