A study of different techniques for solving the shortest path problem.
Entesar Hamed Ibrahim Eliwa;
Abstract
The shortest path problemlies at the hear of network flows and also the most commonly encountered problems in the study of transportation, communication networks and computer science.
A closely related problem is the K shortest path problem, where the obj
A closely related problem is the K shortest path problem, where the obj
Other data
| Title | A study of different techniques for solving the shortest path problem. | Authors | Entesar Hamed Ibrahim Eliwa | Keywords | A study of different techniques for solving the shortest path problem. | Issue Date | 2007 | Description | The shortest path problemlies at the hear of network flows and also the most commonly encountered problems in the study of transportation, communication networks and computer science. A closely related problem is the K shortest path problem, where the obj |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.