Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Turbo Dijkstra. Finding Single-Source Shortest Paths on Planar Graphs with Nonnegative Edge Weights in Linear Time

by Anonym
Sold out
Current price ₹2,671.00
Original price ₹3,138.00
Original price ₹3,138.00
Original price ₹3,138.00
(-15%)
₹2,671.00
Current price ₹2,671.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783346376497
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Grin Verlag
  • Publisher Imprint: Grin Verlag
  • Publication Date:
  • Pages: 20
  • Original Price: GBP 24.9
  • Language: English
  • Edition: N/A
  • Item Weight: 41 grams
  • BISAC Subject(s): Information Technology

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us