### Table 3: Non weighted graphs.

"... In PAGE 15: ...General Graphs Tables 3 and 4 describe brie y some of the most important algorithms for solving the general problem, in which the graph is not necessarily bi- partite. The algorithm of Mulmuley, Vazirani and Vazirani [33], showed in Table3 , is probabilistic (Monte Carlo). Sequential Algorithms Date Authors Ref.... ..."

### Table 2 Execution time for computing weighted graphs

"... In PAGE 7: ... The computation of the graph takes O(jV j log jV j) time [20]. Table2 shows the execution time for computing our extended SIG on surfel-based models with di erent sizes. The algorithm implemented with non-optimized C++ code has been executed on an Intel Pentium 4 2.... ..."

### Table 5: 3-partition for weighted Graphs

1999

Cited by 20

### Table 6: 4-partition for weighted Graphs

1999

Cited by 20

### Table 4: Results of the bounded-error algorithm on 3-weight graphs.

2002

"... In PAGE 21: ... Figure 6 illustrates a particular execution of the bounded-error approximative algorithm. Table4 shows the results of applying the bounded-error approximative algorithm on three di erent 3-weight graphs. The three graphs were obtained from a 37 21 map, a 38 31 map and a 42 41 map, respectively.... ..."

Cited by 1

### Table 1: Edge weights for graph G in Figure 1.

"... In PAGE 6: ... Why should author x obtain more rank than author y from a particular citing author only for the reason that he/she has written more publications? Briefly, we set b to zero whenever c is zero. Example Table1 shows edge weights for graph G in Figure 1. The coefficients f, g, h, and hd are zero when c is zero as mentioned in the paragraph above, but their non-zero variants are also presented in parentheses for illustration.... In PAGE 21: ... The newest citing paper is from 2001 as pointed out above. Prediction We show the top 40 authors for each ranking method in Table 8, Table 9, Table1 0, and Table 11 in an appendix.... In PAGE 29: ...29 Table1 0: Top 40 DBLP authors for each ranking (part 3). b c d 1 Michael Stonebraker Michael Stonebraker Michael Stonebraker 2 Jim Gray Jim Gray Jim Gray 3 David J.... In PAGE 30: ...30 Table1 1: Top 40 DBLP authors for each ranking (part 4). e f g 1 Michael Stonebraker Jim Gray E.... ..."

### Table 3. Calculation of new weights in graphs P, A and B

2005

"... In PAGE 11: ... The procedure for calculation of the similarity between case P and cases A and B from the case base is illustrated by the example given in Figure 2. The calculation of new weights of edges with which they will contribute to the similarity measure are given in Table3 , while Table 4 presents the calculation of new similarities between the cases P and A and B. According to this new similarity measure, case A is more similar to case P than case B.... ..."

Cited by 4

### Table 2. Calculation of new weights in graphs P, A and B

2005

"... In PAGE 11: ... The procedure for calculation of the similarity between case P and cases A and B from the case base is illustrated by the example given in Figure 2. The calculation of new weights of edges with which they will contribute to the similarity measure are given in Table2 , while Table 3 presents the calculation of new similarities between cases P and A and B. According to this new similarity measure, case A is more similar to case P than case B.... ..."

Cited by 4