### Table 1: The Ramsey numbers for paths versus kipases

2004

"... In PAGE 9: ... 3 Conclusion In this paper we determined the exact Ramsey numbers for paths versus kipases of varying orders. The numbers are indicated in Table1 . We used different shadings to distinguish the results in the previous section that led to these numbers.... ..."

### Table 1. The planar Ramsey numbers for cycles

"... In PAGE 8: ... Remarks Remark 1. Some theorems presented in Table1 can be formulated... ..."

### Table 2: Hypercube vs metacube

2002

"... In PAGE 3: ... 3 Topological Properties of a Metacube A topology is evaluated in terms of a number of pa- rameters such as degree, diameter, bisection width, cost (defined as the product of the degree and diam- eter), average distance for any two nodes, regularity, symmetry etc. Table2 summarizes the degree, diam- eter, cost, average node distance and bisection width of a hypercube and a metacube network, assuming that both networks have the same number of nodes - 2n, where n = m2k + k. The degree, or the number of links per node, of an n-cube is n.... ..."

Cited by 3

### Table 3. Mesg. requirements in hypercubes

in Fault-Tolerant Clock Synchronization of Large Multicomputers via Multistep Interactive Convergence

1996

"... In PAGE 9: ... In this case, clock values can be conveyed along node-disjoint paths whose length is at most d(log2 N)=2e+2. Table3 compares 2-ICV with TCID ICV from the viewpoint of number of messages and maximum path length, for hypercubes of various sizes.... ..."

Cited by 1

### Table 1: The effect of clique separators

2004

"... In PAGE 13: ...reprocessing rules. Such separators generate lots of small graphs that can be neglected anyway. We carried out three experiments on these instances: the effect of (i) clique separators, (ii) clique and almost clique separators, and (iii) clique and almost clique separators as well as separators of size three. For the first experiment, Table1 shows the results for those graphs that contain clique separators. The graphs not reported on do not contain clique separators.... In PAGE 14: ... Note that by each decomposition the total number of vertices (over all graphs) increases by at least one. Table1 shows that sometimes large components are decomposed from the rest of the graph; by that reducing the size of the largest component significantly. The computation times (in seconds) for this separation are very small.... ..."

Cited by 15

### Table 1: The effect of clique separators

2004

"... In PAGE 13: ...reprocessing rules. Such separators generate lots of small graphs that can be neglected anyway. We carried out three experiments on these instances: the effect of (i) clique separators, (ii) clique and almost clique separators, and (iii) clique and almost clique separators as well as separators of size three. For the first experiment, Table1 shows the results for those graphs that contain clique separators. The graphs not reported on do not contain clique separators.... In PAGE 14: ... Note that by each decomposition the total number of vertices (over all graphs) increases by at least one. Table1 shows that sometimes large components are decomposed from the rest of the graph; by that reducing the size of the largest component significantly. The computation times (in seconds) for this separation are very small.... ..."

Cited by 15

### Table 1: The effect of clique separators

2004

"... In PAGE 13: ...reprocessing rules. Such separators generate lots of small graphs that can be neglected anyway. We carried out three experiments on these instances: the effect of (i) clique separators, (ii) clique and almost clique separators, and (iii) clique and almost clique separators as well as separators of size three. For the first experiment, Table1 shows the results for those graphs that contain clique separators. The graphs not reported on do not contain clique separators.... In PAGE 14: ... Note that by each decomposition the total number of vertices (over all graphs) increases by at least one. Table1 shows that sometimes large components are decomposed from the rest of the graph; by that reducing the size of the largest component significantly. The computation times (in seconds) for this separation are very small.... ..."

Cited by 15

### Table 1: The efiect of clique separators

2004

"... In PAGE 13: ...reprocessing rules. Such separators generate lots of small graphs that can be neglected anyway. We carried out three experiments on these instances: the efiect of (i) clique separators, (ii) clique and almost clique separators, and (iii) clique and almost clique separators as well as separators of size three. For the flrst experiment, Table1 shows the results for those graphs that contain clique separators. The graphs not reported on do not contain clique separators.... In PAGE 14: ... Note that by each decomposition the total number of vertices (over all graphs) increases by at least one. Table1 shows that sometimes large components are decomposed from the rest of the graph; by that reducing the size of the largest component signiflcantly. The computation times (in seconds) for this separation are very small.... ..."

Cited by 15