|
Graph representation
|
|
G
|
graph, consisting of the sets V and E
|
|
V
|
set of vertices |
|
E
|
set of edges |
|
v
i
|
vertex with index i
|
| (v
i, v
j) |
edge from v
i to v
j
|
|
w
(vi, vj)
|
weight of edge (v
i, v
j) |
|
v
i ⇝ v
j
|
path from v
i to v
j
|
|
|
path from v
i to v
j with summed weight k
|
|
l
|
path length, i.e. no. edges in a path |
|
Algorithm
|
| (v
a, v
b) |
edge under investigation in current algorithmic iteration |
|
w
(va, vb)
|
weight of the edge under investigation |
|
θ
|
threshold to account for imprecisions in interaction delay reconstruction |
|
w
crit
|
critical path weight, w
crit = w
(va, vb) + θ (target weight of the algorithm) |
|
v
s, v
t
|
start and target node (v
s = v
a, v
t = v
b) |
|
|
set of solutions in algorithmic step n, that solve the subproblem
|
