Exact and Approximate Distances in Graphs — A Survey

  • Uri Zwick
Conference paper

DOI: 10.1007/3-540-44676-1_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2161)
Cite this paper as:
Zwick U. (2001) Exact and Approximate Distances in Graphs — A Survey. In: auf der Heide F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg

Abstract

W survey recent and not so recent results related to the computation of exact and approximate distances, and corresponding shortest, or almost shortest, paths in graphs. We consider many different settings and models and try to identify some remaining open problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Uri Zwick
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations