Anonym 
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time [PDF ebook] 

Support

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.

€13.99
Zahlungsmethoden
Dieses Ebook kaufen – und ein weitere GRATIS erhalten!
Sprache Englisch ● Format PDF ● Seiten 21 ● ISBN 9783346376480 ● Dateigröße 1.1 MB ● Verlag GRIN Verlag ● Ort München ● Land DE ● Erscheinungsjahr 2021 ● Ausgabe 1 ● herunterladbar 24 Monate ● Währung EUR ● ID 7794047 ● Kopierschutz ohne

Ebooks vom selben Autor / Herausgeber

16.795 Ebooks in dieser Kategorie