Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time

Anonym (Autor)

Buch | Softcover

20 Seiten

2021 | 21001 A. 1. Auflage
GRIN Verlag
978-3-346-37649-7 (ISBN)

Titel nicht im Sortiment

Artikel merken

Seminar paper from the year 2021 in the subject Computer Science - Theory, grade: 1.0 (A), University of Passau, language: English, abstract: The need to find shortest paths in a graph from some fixed source vertex to all other vertices is quite obvious and therefore one of the most important problems in graph theory. For general graphs, the standard way to go is the Dijkstra algorithm. On planar graphs, this approach takes linearithmic time in the number of vertices. However, we present an algorithm published by Henzinger et al. in 1997 that accomplishes the task in linear time on planar graphs.

Erscheinungsdatum	13.06.2021
Sprache	englisch
Maße	148 x 210 mm
Gewicht	45 g
Themenwelt	Mathematik / Informatik ► Informatik
Schlagworte	Dijkstra • graphtheory • lineartime • Optimization • planargraphs • shortestpaths • timecomplexity
ISBN-10	3-346-37649-4 / 3346376494
ISBN-13	978-3-346-37649-7 / 9783346376497
Zustand	Neuware