### Table 1. Comparison over GraphBase directed graphs.

2005

"... In PAGE 4: ... The first set comes from [8]. The graphs are characterized by their probability (eta = 0:01 is noted r001 in Table1 ) that an edge is present between two distinct node n and n0. Those graphs were used to evaluate vflib algorithm performance [7].... In PAGE 4: ... Experiments show that CSP approach for subgraph matching solves more problem within a time limit against C++ specialized checking-based methods [7]. Table1 and 2 show the percentage of instances solved within a time limit of 5 minutes, for directed and undirected instances. Single specialized propagator MCPA for forbidden edges is more efficient than the version with two propagators.... ..."

Cited by 5

### Table 3. Algebraic connectivity of connected graphs on six vertices

"... In PAGE 4: ... Paper n5b55n5d provides pictures of the 509 cubic graphs on fourteen vertices and some non-spectral data. Table3 in n5b24n5d, based on n5b5n5d, contains connected cubic graphs with up to 12 vertices. The pictures, spectrum and coen0ecients of the characteristic polynomials are included.... In PAGE 9: ... Table 2 contains algebraic connectivities for graphs in Table 1. Table3 refers to the table of 112 connected graphs on six vertices from n5b29n5d which is described in Section 1. Using identin0ccation numbers of graphs from n5b29n5d we give algebraic connectivities of the 112 connected graphs.... ..."

### Table 4: Convergence rates for the multigrid V{cycle. The multigrid method with standard transfer operators is divergent. From Table 4 it is obvious that the exponentially tted hierarchical bases transfer operators can compete with the algebraic matrix-dependent transfers. Though it is not as easy to construct them as it is for the matrix- dependent transfer operators they can be generalized to tensor product discretisations (see e.g. [RST96]) of the 2D convection-di usion equation. Acknowledgement. I thank Dr. Willy Dor er for many fruitful discussions and for helping me with the preparation of this paper.

"... In PAGE 9: ... The hierarchical transfer operators are chosen as indicated in Section 4. In Table4 convergence rates are listed for the V{cycle using the di erent transfer operators and Gauss{Seidel and damped Jacobi smoothing, respectively, for the problems (5.... ..."

### Table 3: Test set based on chess graphs and match.

2000

Cited by 51

### Table 2: Percentage accuracy (with standard devi- ations in parentheses) of the unbiased and algebraic- ally biased GA, based on 10 repetitions of each ex- periment.

1994

"... In PAGE 5: ... Hence, the GA is not only having to generalise to unseen strings, but to strings of a length never seen during evolution. The results in Table2 show that there is a distinct performance gain in algebraically biasing the chro- mosomes. However, Table 3 shows that this biasing is insu cient for evolving the more di cult 3-symbol palindromes.... In PAGE 5: ... However, we see that the ENF structuring is very e ective, and from the the graph in Figure 1 we see that convergence is normally achieved within well under 10 generations. Incidentally, there ENF structuring was developed after the algebraic bias- ing, and there has not been time yet to test it on the easier problems in Table2 , but it would be expec- ted to perform poorer than the algebraic method on the parity problem (due to its context-free bias), and much better than the algebraic method on 2-symbol palindromes. Training Set Test Set Grammar Normal Biased Normal Biased Parity 97 (5.... ..."

Cited by 13

### Table 2: Results of power grids designed for FC circuits by the proposed method and the multigrid-based scheme of [5]

### Table 1. Types of queries and matching methods in image-based search Query Matched with: Matching algorithm

1999

"... In PAGE 1: ... On the world-wide web (WWW), various experi- mental approaches are already available[9], from which some lessons can be drawn. Textual methods which are based on keyword queries ( Table1 , A) to nd images are potentially very powerful. However, a textual annotation of images produced by a single content provider, al- though already very costly by itself, usually does not cover a su cient number of views or perspec- tives on the same pictorial material.... ..."

Cited by 1

### TABLE II RESULTS OF POWER GRIDS DESIGNED FOR FLIP-CHIP CIRCUITS BY THE PROPOSED METHOD AND THE MULTIGRID-BASED SCHEME OF [4]

### Table 1: Language and algebraic concepts of a VL 5

1997

"... In PAGE 5: ...entences based on graph grammar concepts. I.e. given a start graph which is an algebra wrt. to the corresponding speci cation, all sentences of a visual language can be derived by applying grammar rules formulated on the de ned symbols and links. Table1 illustrates the connection between the language and algebraic concepts we use within our approach.... ..."

Cited by 8