### Table 1. All reconstructed cubes of the adjacency graph of the SNF(f) of Figure 2

"... In PAGE 8: ... The question arises, whether each vertex of the adjacency graph of the SNF( f ) leads to a cube of the exact minimal ESOP of f . In order to answer this question, Table1 enumerates all created cubes based on each selected cube of AGSNF(f)(V,E) of Figure 2. The created cubes and the associated conjunctions in the first 4 lines and in the last 4 lines of Table 1 show the cubes of the minimal ESOP; several other cubes can be created as well.... In PAGE 8: ... In order to answer this question, Table 1 enumerates all created cubes based on each selected cube of AGSNF(f)(V,E) of Figure 2. The created cubes and the associated conjunctions in the first 4 lines and in the last 4 lines of Table1 show the cubes of the minimal ESOP; several other cubes can be created as well. This example shows that in general not each vertex of the adjacency graph of the SNF( f ) can be used to reconstruct the exact minimal ESOP of f .... In PAGE 11: ... The minimal weight in Table 4 is 6 for the SNF vertices labeled by (001) and (1-0), respectively. In Table1 the associated cubes x1x3 and x1x2x3 of the minimal... ..."

### Table 1 Routing labeling schemes obtained for special graph classes via collective additive tree spanners.

"... In PAGE 17: ...where p(n) is the time needed to find a balanced and bounded radius separator S and t(n) is the time needed to find a central vertex for S. Projecting this theorem to the particular graph classes considered in this paper, we obtain the following results summarized in Table1 . For circular-arc graphs, the labels are of size O(log2 n) bits per vertex since this size labels are needed to decide in constant time which tree T or Tu is good for routing for given source x and destination y.... ..."

### Table 1.1 Graph coloring formulations for computing all nonzero entries of derivative matrices. The Jacobian is represented by its bipartite graph, and the Hessian by its adjacency graph. NA stands for not applicable. The labels in parentheses correspond to those used in Figure 1.3.

2005

Cited by 12

### Table 1. RelGraph adjacency matrix.

2004

Cited by 3