Research Article
A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs
Table 1
Benchmarking results for application Example 1, Case
1.
| Concept | Exact shortest path | Convergence | Convergence starts at () |
| Concept in [42] | | Yes | ā50 | NAOP concept | | Yes | ā2 |
|
|