Advertisement

Graph algorithms

  • Alexander Shen
Chapter
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

Abstract

We have already seen several problems related to graphs. In this chapter we consider in more details two classes of problems: computation of shortest paths (section 9.1) and graph traversal algorithms (section 9.2).

Keywords

Short Path Minimal Cost Outgoing Edge Graph Algorithm Cost Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Laboratoire d’Informatique Fondamentale de Marseille (LIF) CNRSUniversité de la Méditerranée, Université de ProvenceMarseille Cedex 13France
  2. 2.Russian Academy of SciencesInstitute for Information Transmission ProblemsMoscowRussia

Personalised recommendations