Skip to main content

Table 4 The analyzed algorithms with their respective parameter values

From: Comparative analysis of box-covering algorithms for fractal networks

Abbr.

Algorithm

Hyperparameters

cbb

cbb

d30

Differential evolution

p: 40, f: 0.9, c: 0.85, g: 30

d70

Differential evolution

p: 40, f: 0.9, c: 0.85, g: 70

fuz

Fuzzy

gre

Greedy

Strategy: random_sequential (see networkx package)

mc.25

mcwr

p: 0.25

mc.5

mcwr

p: 0.5

mc.75

mcwr

p: 0.75

memb

memb

mer

Merge

obca

obca

ps.2k

pso

g: 200, p: 99, c\(_{1}\): 1.494, c\(_{2}\): 1.494

ps1k

pso

g: 1000, p: 99, c\(_{1}\): 1.494, c\(_{2}\): 1.494

remcc

remcc

rs

Random sequential

sa

Simulated annealing

k\(_{1}\): 5000, k\(_{2}\): 5, k\(_{3}\): 20, T\(_{0}\): 0.6, c: 0.995

sm10

Sampling

Inner algorithm: maximal box sampling, n: 10, strategy: small first

sm40

Sampling

Inner algorithm: maximal box sampling, n: 40, strategy: small first

sr10

Sampling

Inner algorithm: random sequential, n: 10, strategy: small first

sr40

Sampling

Inner algorithm: random sequential, n: 40, strategy: small first

  1. The leftmost column stands for the abbreviation. In some plots, the expanded version of these abbreviations appears but it is clear what they mean