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

Destek

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
Ödeme metodları
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim PDF ● Sayfalar 21 ● ISBN 9783346376480 ● Dosya boyutu 1.1 MB ● Yayımcı GRIN Verlag ● Kent München ● Ülke DE ● Yayınlanan 2021 ● Baskı 1 ● İndirilebilir 24 aylar ● Döviz EUR ● Kimlik 7794047 ● Kopya koruma olmadan

Aynı yazardan daha fazla e-kitap / Editör

16.795 Bu kategorideki e-kitaplar