Items related to Turbo Dijkstra. Finding Single-Source Shortest Paths...
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Turbo Dijkstra. Finding Single-Source Shortest Paths...
Stock Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLING22Oct2817130026494
Quantity: Over 20 available
Stock Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783346376497
Quantity: Over 20 available
Seller Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 20 pp. Englisch. Seller Inventory # 9783346376497
Quantity: 2 available
Stock Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Hervorragend. Zustand: Hervorragend | Seiten: 20 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 38509730/1
Quantity: 1 available
Seller Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Published by
GRIN Verlag, GRIN Verlag Jun 2021, 2021
ISBN 10: 3346376494
ISBN 13: 9783346376497
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -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. 20 pp. Englisch. Seller Inventory # 9783346376497
Quantity: 2 available
Seller Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783346376497
Quantity: 1 available
Seller Image
Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time | Anonym | Taschenbuch | Englisch | 2021 | GRIN Verlag | EAN 9783346376497 | Verantwortliche Person für die EU: preigu, Ansas Meyer, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 120220868
Quantity: 5 available