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.
Limba Engleză ● Format PDF ● Pagini 15 ● ISBN 9783346376480 ● Mărime fișier 1.2 MB ● Editura GRIN Verlag ● Oraș München ● Țară DE ● Publicat 2021 ● Ediție 1 ● Descărcabil 24 luni ● Valută EUR ● ID 7794047 ● Protecție împotriva copiilor fără