### Table 1 We would like to remark that in order to avoid \lucky quot; reductions, we ran Minimum Degree on 5 random permutations of each graph, and chose the ordering that gave the lowest ll as the starting ordering.

"... In PAGE 9: ...rderings that are minimal need not be 2-optimal, as shown in Fig.1. Thus Minimum Degree is a good starting ordering for our purposes. Table1 and... ..."

### Table 5. Graph topologies.

"... In PAGE 12: ... In fact, head states are a locally optimal choice because we can evaluate no better choice based on local conditions only. The benchmarks we used had a considerable number of head states ( Table5 ) and forced us to develop sophisticated algorithms to select the optimum one. Table 5.... ..."

### Table 8 Graph 6

"... In PAGE 10: ...n our simulation 1,187,169 Choice Points were created with an average size of 10.9 words, 2.9 words for the argument registers and 8 words for bookkeeping. Table8 shows the number of occurrences, its relative percentage and accumulated percentage of the creation of a Choice Point with n arguments. Graph 6 plots the percentage.... ..."

### Table 8 Graph 6

"... In PAGE 10: ...n our simulation 1,187,169 Choice Points were created with an average size of 10.9 words, 2.9 words for the argument registers and 8 words for bookkeeping. Table8 shows the number of occurrences, its relative percentage and accumulated percentage of the creation of a Choice Point with n arguments. Graph 6 plots the percentage.... ..."

### Table 5: Results on DIMACS \snapshot quot; instances, best move choice based on vertex degree in original graph, not on degree in G(S).

2001

"... In PAGE 24: ... 2 (lines 8{9) has been substituted with degG(V ), whose values are calculated in the initialization part of the RLS algorithm. The computational results are listed in Table5 . As it was expected, the number of iterations per second always increases with respect to those obtained in Table 3.... ..."

Cited by 55

### Table 1: The choices for [XjY ] that give extendible submatrices B.

"... In PAGE 7: ...Appendix As mentioned in the text, the six choices for the matrix B from Theorem 1 given in Table1 can be extended still further and can be embedded in what were termed feasible submatrices of order 28. There are 89 of these in total, but it turned out that only those that arose from numbers I, VI, V and VI could be extended all the way to a strongly regular graph.... In PAGE 7: ... There are 89 of these in total, but it turned out that only those that arose from numbers I, VI, V and VI could be extended all the way to a strongly regular graph. In Table1 the notation (x; y) is used to indicate that the corresponding submatrix gives rise to x extensions, which in turn yield y strongly regular graphs. There are eleven graphs on eighteen vertices each of which is the union of disjoint cycles of lengths a multiple of 3, but of these there are three that do not occur as a neighbour graph in any of the 167 strongly regular graphs.... ..."

### Table 1: The choices for [XjY ] that give extendible submatrices B.

"... In PAGE 7: ...Appendix As mentioned in the text, the six choices for the matrix B from Theorem 1 given in Table1 can be extended still further and can be embedded in what were termed feasible submatrices of order 28. There are 89 of these in total, but it turned out that only those that arose from numbers I, VI, V and VI could be extended all the way to a strongly regular graph.... In PAGE 7: ... There are 89 of these in total, but it turned out that only those that arose from numbers I, VI, V and VI could be extended all the way to a strongly regular graph. In Table1 the notation (x; y) is used to indicate that the corresponding submatrix gives rise to x extensions, which in turn yield y strongly regular graphs. There are eleven graphs on eighteen vertices each of which is the union of disjoint cycles of lengths a multiple of 3, but of these there are three that do not occur as a neighbour graph in any of the 167 strongly regular graphs.... ..."

### Table 1. Number of choices available

"... In PAGE 5: ... As the BNF definition is a plug-in component of the system, it means that GE can produce code in any lan- guage, thereby giving the system a unique flexibility. For the above BNF, Table1 summarizes the production rules and the number of choices associated with each one. Table 1.... ..."

### Table 2. Alignment Statistics for the Three Pairs of Eukaryotic Organismsa

2005

"... In PAGE 13: ...1. Detailed statistics on alignment of the three pairs of eukaryotic PPI networks are shown in Table2 . In this table, we list the number of nodes in the alignment graph, nodes with at least one matched edge, matches, mismatches, and duplications in both organisms.... ..."

Cited by 3

### Table 5: Number of Hard Graphs for Degreebound Graphs

1998

Cited by 16