Improved Algorithms for Dynamic Shortest Paths

@article{Djidjev2000ImprovedAF,
  title={Improved Algorithms for Dynamic Shortest Paths},
  author={Hristo Djidjev and Grammati E. Pantziou and Christos D. Zaroliagis},
  journal={Algorithmica},
  year={2000},
  volume={28},
  pages={367-389}
}
We describe algorithms for finding shortest paths and distances in outerplanar and planar digraphs that exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic environment, where the cost of any edge can be changed or the edge can be deleted. In the case of outerplanar digraphs, our data structures can be updated after any such change in only logarithmic time. A distance query is also answered in logarithmic time. In the case… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 38 references

and C

  • G. Pantziou, P. Spirakis
  • Zaroliagis, Efficient Parallel Algorithms for…
  • 1992
Highly Influential
12 Excerpts

and U

  • G. Ausiello, G. F. Italiano, A. M. Spaccamela
  • Nanni, Incremental Algorithms for Minimal Length…
  • 1991
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…