Order Total (1 Item Items):
Shipping Destination:
Turbo Dijkstra Finding Single Source by Anonym (4 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (4)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (4)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (4)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (2)
- Not Print on Demand (3)
Language (1)
Price
- Any Price
- Under US$ 25
- US$ 25 to US$ 50
- Over US$ 50 (No further results match this refinement)
Free Shipping
Seller Location
Seller Rating
-
US$ 33.00
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New.
-
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
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
US$ 19.19
Convert currencyUS$ 70.10 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. 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.
-
US$ 19.19
Convert currencyUS$ 81.78 shipping from Germany to U.S.A.Quantity: 5 available
Add to basketTaschenbuch. 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.
