### Table 2 The number of edges removed by the edge-insertion algorithm when it computes MV from either

"... In PAGE 13: ... It is interesting to note that the amountofwork needed to construct MV is far less for points in a square than for points near a circle. Table2 shows the number of edges removed during the construction of MV . While the di erence between the twopoint distributions is striking, the choice of the initial triangulation seems to have far less in uence on the running time of the edge-insertion algorithm.... ..."

### Table 1: Simple algorithm for computing minimal distance functions on the edges.

2004

Cited by 1

### Table 1: Computed values of the optimality criteria for the step edge.

1998

Cited by 1

### Table 5: Computational results for b1496 (# nodes=3622, # edges=10331).

### Table 6: Computational results for b2296 (# nodes=3008, # edges=20940).

### Table 7: Computational results for l518 (# nodes=3820, # edges=35774).

### Table 8: Computational results for l247 (# nodes=3408, # edges=25990).

### Table 2: DNA sequences for edges

"... In PAGE 6: ... The oligo is synthesized so that the number of DNA bases of that oligo and the cost at the corresponding edge are similar. Table2 on the other hand lists all the synthesized oligos based on the proposed synthesis rules. Again, DNASequenceGenerator [14] is employed.... In PAGE 8: ... In order to overcome the limitation of general length-based DNA computing, the authors discovered that by utilizing parallel overlap assembly method for initial pool generation, a phase where numerous combinations of random routes of the graph are generated in the solution, one shortcoming which is the biological influence contributed by the length of the oligos could be minimized as much as possible. In order to generate the initial pool of the direct-proportional length-based DNA computing for the example problem by using POA method, the input to the computation will be all the synthesized oligos as listed in Table2 and the complement sequences for each nodes. These inputs are poured into a test tube and the cycles begin.... ..."

Cited by 1

### Table 4-1 Edge Mask Specification

2000

"... In PAGE 75: ... The left edge mask is computed from the three least-significant bits (LSBs) of address1. The right edge mask is computed from the three LSBs of address2, according to Table4 -1 or, for little-endian byte ordering, Table 4-2. Table 4-1 Edge Mask Specification... ..."

### Table 2: Summary of the numerical experiments for the edge elements.

"... In PAGE 4: ... In terms of accuracy, the results of the two methods agree within the discret- ization error. The computational e ort of the edge element discretization is presented in Table2 . We can see that the edge elements take more iterations to converge but require less oating point operations.... ..."