Shortest Paths

Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over shortest routes, therefore, in shortest possible time between two routers in a computer network. This so-called routing problem is commonly so...

Full description

Saved in:
Bibliographic Details
Published inAlgebraic Graph Algorithms pp. 109 - 125
Main Author Erciyes, K
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2021
Springer International Publishing
SeriesUndergraduate Topics in Computer Science
Online AccessGet full text
ISBN3030878856
9783030878856
ISSN1863-7310
2197-1781
DOI10.1007/978-3-030-87886-3_7

Cover

More Information
Summary:Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over shortest routes, therefore, in shortest possible time between two routers in a computer network. This so-called routing problem is commonly solved by converting a graph routing algorithm to a distributed one in the form of a network protocol to be executed by each router. We look at basic graph algorithms to find shortest paths in a weighted graph in this chapter.
ISBN:3030878856
9783030878856
ISSN:1863-7310
2197-1781
DOI:10.1007/978-3-030-87886-3_7