### Table 2. Graphs on 5 vertices that are not complete multipartite Graph Independent Sequence Covering

1995

"... In PAGE 14: ... From Corollary 1 we get (C5; jSj) = (5=2) log jSj, where jSj = 22r, for some positive integer r. Finally, in Table2 we list the remaining graphs that are not complete multipartite, their independent sequences, and the complete multipartite subgraphs needed to cover all their edges, from which we get that (G; jSj) = 2 log jSj for each such graph (note that the vertex sets of these graphs are taken to be f1; 2; 3; 4; 5g in Table 2). 4.... ..."

Cited by 9

### Table 2: Complete graphs. npXc corresponds to a graph with X nodes. CMOD2 is CMODELS2

2004

"... In PAGE 5: ... Thus, one would expect these problems to be difficult for ASSAT, but also for CMODELS2 in the case it will generate and then re- ject (exponentially) many candidate answer sets. The results are in Table2 . As can be observed, on this test set CMOD- ELS2 performs best, being faster (sometimes by orders of magnitude) than all the other solvers both on standard and extended programs.... ..."

Cited by 17

### Table 1. Connection points of the switch matrix shown in Figure 1 and their flexibility sets and complete graphs.

"... In PAGE 7: ... This graph has (4 + 2) = 6 vertices and (1 + 6 + (4 x 2)) = 15 edges. Table1 shows the... In PAGE 16: ... We kept only the routable rrvs. Table1 shows the switch matrices and the number of rrvs. Size Programmable Points Columns in canonical formulation Rows in canonical formulation Number of rrvs 10 x 10 60 121 127 50 20 x 20 220 472 478 20 30 x 30 480 1025 1031 20 40 x 40 840 1834 1840 20 Table 1.... In PAGE 16: ...olve XPRESS-MP [] to get an exact solution. We kept only the routable rrvs. Table 1 shows the switch matrices and the number of rrvs. Size Programmable Points Columns in canonical formulation Rows in canonical formulation Number of rrvs 10 x 10 60 121 127 50 20 x 20 220 472 478 20 30 x 30 480 1025 1031 20 40 x 40 840 1834 1840 20 Table1 . Switch matrices used in the experiments.... ..."

### Table 1. Number of times that each PC is selected, out of 1,000,000 Toeplitz correlation structure, completely null case, p = 6.

"... In PAGE 6: ... In these simulations there is no discriminatory power in any of the variables, and hence none in any of the PCs. Table1 shows a typical set of results for this null-case. Table 1 about here In Table 1 we report the number of times that each PC was chosen, in 1 million simulations, using a 5% test based on result (10).... In PAGE 6: ... Table 1 shows a typical set of results for this null-case. Table1 about here In Table 1 we report the number of times that each PC was chosen, in 1 million simulations, using a 5% test based on result (10). In Table 1, p = 6 and the structure of the correlation matrix has a Toeplitz form, as described below in Section 4.... In PAGE 6: ... Table 1 shows a typical set of results for this null-case. Table 1 about here In Table1 we report the number of times that each PC was chosen, in 1 million simulations, using a 5% test based on result (10). In Table 1, p = 6 and the structure of the correlation matrix has a Toeplitz form, as described below in Section 4.... In PAGE 6: ... Table 1 about here In Table 1 we report the number of times that each PC was chosen, in 1 million simulations, using a 5% test based on result (10). In Table1 , p = 6 and the structure of the correlation matrix has a Toeplitz form, as described below in Section 4.2.... In PAGE 6: ... 4.2 Power Studies It is useful to know the null behaviour of a selection procedure based on (10), as illustrated by Table1 . However, the non-null case where some of the PCs have discriminatory power is of greater interest.... ..."

### Table 1: Example graph parameters

1998

"... In PAGE 5: ...n the number. Edge weights have to be positive. If no edge weights are given, edge w has to be set to NULL. To illustrate the graph parameters, Table1 shows the parameter for the example graph of Fig. 3.... ..."

Cited by 3

### Table 1: Graph rewriting operators

1995

"... In PAGE 2: ...paradigm. 2 The Rewriting Operations A set of basic graph rewriting operations is listed in Table1 and depicted in Figure 1. Table 3 shows a grammar for growing the complete structure of an adaptive MLP.... ..."

Cited by 15

### Table 1. Null Model Parameter Setting

"... In PAGE 4: ... If the cell count drops to less than 20, the immune system is considered weak and susceptible to opportunistic pathogenesis. Table1 is a summary of the parameter settings for the null model, including the initial entity counts and production rates (per time unit). The parameters are verified through experimental simulations such that HIV infection appears weak in the face of immune response, and AIDS does not develop in ... In PAGE 5: ...1 Null Model Population Dynamics The null model serves as a template for all four HIV infection hypotheses. Figure 5 shows the simulation result of the null model based on the agent rule specification in Figure 2 and Figure 3 and the parameter settings from Table1 . HIV is introduced into the system at t=0 with a count of 50.... ..."

### Table 1: Labelings of the Complete Graph on 5 vertices

2004

"... In PAGE 16: ... For K 5 , wemust have35 k 45. In Table1 we exhibit one solution for each k 40. For K 6 ,weget59 k 73.... ..."

Cited by 5

### Table 2: Labelings of the Complete Graph on 6 vertices

2004

"... In PAGE 16: ... For K 6 ,weget59 k 73. Sho wn in Table2 is one solution for... ..."

Cited by 5