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.

ConceptExact shortest pathConvergenceConvergence starts at ()

Concept in [42]Yesā‰ˆ50
NAOP conceptYesā‰ˆ2