The shortest-path problem : analysis and comparison of methods / Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano.
Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road netwo...
Saved in:
| Online Access: |
Full Text (via Morgan & Claypool) |
|---|---|
| Main Authors: | , , |
| Format: | eBook |
| Language: | English |
| Published: |
San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) :
Morgan & Claypool,
2015.
|
| Series: | Synthesis lectures on theoretical computer science ;
# 1. |
| Subjects: |
Internet
Full Text (via Morgan & Claypool)Online
| Call Number: |
QA166.245 .O788 2015
|
|---|---|
| QA166.245 .O788 2015 | Available |