Improved Runtimes and Lower Bounds for Dual-Edge Failure Replacement Path Algorithms
Given a graph G and a fixed pair of nodes s and t, the Replacement Paths problem is to compute the new shortest distance from s to t when there are edge failures in G (i.e. those edges can no longer be used for any path). While there has been extensive research into the single-failure Replacement Pa...
| Hlavní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Diplomová práce |
| Vydáno: |
Massachusetts Institute of Technology
2022
|
| On-line přístup: | https://hdl.handle.net/1721.1/139098 |