Ranked k-shorttestt patths iin nettwork
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Brhane, Tsegay | |
| dc.date.accessioned | 2018-07-19T06:56:47Z | |
| dc.date.accessioned | 2023-11-04T12:30:35Z | |
| dc.date.available | 2018-07-19T06:56:47Z | |
| dc.date.available | 2023-11-04T12:30:35Z | |
| dc.date.issued | 2011-01 | |
| dc.description.abstract | The complete set of this paper focuses on k-shortest path problem and algorithms which solve k-shortest path in a graph G where V is set of n nodes and E is set of m arcs. and I have discussed how to compute the first, second, third, k ht shortest path (in order) from the source node to every other nodes by using labeling algorithm which is label setting and label correcting algorithm and path removing algorithm in a given network | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/9347 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Ranked k-shorttestt patths iin nettwork | en_US |
| dc.title | Ranked k-shorttestt patths iin nettwork | en_US |
| dc.type | Thesis | en_US |