### Table 2. Number of trust paths found for scale free topology for different TTL values. Target is 4 hops away.

"... In PAGE 7: ... Discovery of the first trust path. Table 1 and Table2 show the number of trust paths found, for different values of TTL, for the random and scale-free topology, respectively. The graphs in Figure 2 and Figure 3 show the number of messages propagated through the network for each algorithm, for different values of TTL.... In PAGE 7: ... Moreover, these messages can be redundant, because they forward a query to a node that earlier received that same query (see [14] for an in-depth discussion). However, Table 1 and Table2 demonstrate the benefit of this higher number of messages in the scale-free topology: the trust path is found within only a few hops for all algorithms. More precisely, the trust path is found in the minimum number of hops (TTL=3 for a target 4 hops away), except for K-walker with 10% forwarding.... ..."

### Table 8 Scale-free properties of the ToscanaJ software package (numbers in brackets are the correlation s) Version N

"... In PAGE 12: ...1070 0.5625 Refer to Table8 for N, the numbe r of classes. S.... In PAGE 13: ...5. The final package of this study, Toscan aJ is a similar size to JEdit but the higher values of cout given in Table8 as comp ared with Tabl e 6 reflect the faster rate of grow th of Tos canaJ over JEdit. This faster grow th is also apparent in the increased hub- like charact er of the former packag e as given by the smal ler values of Qlim.... ..."

### Table 3 Correlation between low-level parameters and average of measured MSE of the NARMA task for Scale-free networks. Each parameter is measured for each network size and then averaged.

"... In PAGE 20: ... Since the models which were considered for small-world and random networks may give disconnected networks, some of mentioned parameters could not be calculated for all such graphs. Table3 presents the correlation between average of measured MSE of the NARMA task and calculated low-level parameters for scale-free reservoirs. The result for small-world and random reservoirs are presented in table 4.... ..."

### Table 2. Reference categories for scale-free networks and general aviation.

2003

"... In PAGE 15: ... (A maximum of 24 for Lederer and Nambimadom [47] and only 7 for Yang and Kornfeld [65]). We close with Table2 , a broad category summary of our literature review of scale-free networks... ..."

### Table 1 Solution space for the graph in Fig. 1 3-Digit binary number The corresponding dominating set 000 B

in Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

2004

"... In PAGE 6: ...By doing this, all of the possible dominating sets in G are transformed into an ensemble of all n-digit binary numbers. Hence, Table1 denotes the solution space for the graph in Fig. 1.... In PAGE 6: ... 1. The binary number 000 in Table1 shows that the corresponding dominating set is empty. The binary numbers, 001, 010 and 011, in Table 1 shows that those cor- responding dominating sets are {v1}, {v2} and {v2,v1} respectively.... In PAGE 6: ...n Fig. 1. The binary number 000 in Table 1 shows that the corresponding dominating set is empty. The binary numbers, 001, 010 and 011, in Table1 shows that those cor- responding dominating sets are {v1}, {v2} and {v2,v1} respectively. The binary num- bers, 100, 101 and 110, in Table 1 shows that the corresponding dominating sets, subsequently, are {v3}, {v3,v1} and {v3,v2}.... In PAGE 6: ... The binary numbers, 001, 010 and 011, in Table 1 shows that those cor- responding dominating sets are {v1}, {v2} and {v2,v1} respectively. The binary num- bers, 100, 101 and 110, in Table1 shows that the corresponding dominating sets, subsequently, are {v3}, {v3,v1} and {v3,v2}. The binary number 111 in Table 1 shows that the corresponding dominating set is {v3,v2,v1}.... In PAGE 6: ... The binary num- bers, 100, 101 and 110, in Table 1 shows that the corresponding dominating sets, subsequently, are {v3}, {v3,v1} and {v3,v2}. The binary number 111 in Table1 shows that the corresponding dominating set is {v3,v2,v1}. Though there are eight 3-digit binary numbers for representing eight possible dominating sets in Table 1, not every 3-digit binary number corresponds to a legal dominating set.... In PAGE 6: ... The binary number 111 in Table 1 shows that the corresponding dominating set is {v3,v2,v1}. Though there are eight 3-digit binary numbers for representing eight possible dominating sets in Table1 , not every 3-digit binary number corresponds to a legal dominating set. Hence, in next subsec- tion, basic biological operations are used to develop an algorithm for removing illegal dominating sets and determining legal dominating sets.... ..."

### Table 4 Comparison of different caching strategies on the class of scale-free networks with 100 nodes

2006

"... In PAGE 7: ... We therefore focus primarily a non- parametric measure, namely the rank the caching strategy achieved when compared to the other strategies tested (with 1 being the best rank, and 6 being the worst rank), averaged over all test cases. The results depicted in Table4 show that both evolved strategies (GPfinal and RUDF) work very well over the randomly generated range of networks in the considered class of scale-free networks. They significantly outperformed all the other strategies tested, with a slight advantage of RUDF over GPfinal.... ..."

### Table 2. Occurrence of constituent dominance.

"... In PAGE 5: ... Figure 13 displays the levels of over-resolution for the inset region. Figures 14 to 27 and Table2 assess the constituent dominance in the spacing requirements. Table 2 presents the number of nodes at which a given constituent produced the minimum node spacing.... In PAGE 5: ... Figures 14 to 27 and Table 2 assess the constituent dominance in the spacing requirements. Table2 presents the number of nodes at which a given constituent produced the minimum node spacing. It should be noted that the forcing produced the majority of these minimum node spacing requirements.... ..."

### Table 3. Reduction rule 1 data for DOMINATING SET

2005

"... In PAGE 37: ...igure 17. Reduction rules for maximum independent set. REMARK 30. As a sequel to the above theorems, the reader might wish to con- sider, as an exercise, why the fifth entry in row six of Table3 is FPT . The outcome in the above theorems seems quite good, and can no doubt be much further improved by more careful attention to the extremal structure theory of graphs of bounded max leaf number, and in particular by employing the deeper structure of Boundary Lemma III.... ..."

Cited by 9

### Table 5 Comparison of different caching strategies on the class of scale-free networks with 30 nodes

2006

### Table 6 Comparison of different caching strategies on the class of scale-free networks with 300 nodes

2006