Improved Shortest Path Algorithms by Dynamic Graph Decomposition
In this thesis, we introduce three new approaches for solving the single source shortest path (SSSP) problem in nearly acyclic directed graphs, and algorithms based on these approaches. In the first approach, we extend a technique of strongly connected components (sc-components) decomposition by Tak...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Canterbury. Computer Science and Software Engineering
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10092/1196 |