Research Article

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

Table 3

Benchmarking results for application Example 2.

ConceptExact shortest pathConvergenceConvergence starts at ()

Concept in [42]Yesā‰ˆ30
NAOP conceptYesā‰ˆ3