Table II.
n | # of nodes in G, | V | = n | |
m | # of edges in G, |E| = m | |
k | upper bound on the size of a patch (user input) | |
N | # of patches (nodes in the patch graph Gp), |VP| = N | N ≤ n(k − 1) |
M | # of pairs of overlapping patches (edges in Gp), |Ep| = M | M ≤ Nk2/2 |
dp | maximum degree in Gp | dp ≤ k2 |
m’ | maximum # of edges in a patch | m’ ≤ k2/2 |