Figure 2

Average path length (a) and probability of finding decision (b) depending on the number of vertexes N and graph density d (optimal decisions).

© De Gruyter