Research Article

A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Table 2

Benchmarking results for application Example 1, Case 2.

ConceptExact shortest pathConvergenceConvergence starts at ()

Concept in [42]No detectionNo convergenceNo convergence
NAOP conceptYesā‰ˆ2