Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions
Finding optimal paths in directed graphs is a wide area of research that has received much of attention in theoretical computer science due to its importance in many applications (e.g., computer networks and road maps). Many algorithms have been developed to solve the optimal paths problem with diff...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
2012
|
| Online Access: | Mahayni, M. A. (2011). Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions. KAUST Research Repository. https://doi.org/10.25781/KAUST-0AV2K http://hdl.handle.net/10754/209371 |