### Table 2: Number of in the connectivity graphs

1992

"... In PAGE 8: ... The scanning is an operation of order O#28dn#29 and, for the examples in Figure 2, takes about #0Cve seconds on a DECstation 5000. Table2 gives the number of arcs in the connectivity graphs and the average number of connections per cell. As can be seen, the number of connections is low and appears to be a result of the typical size distribution of slippery cells.... ..."

Cited by 15

### Table 1: An overview of connected graph searching

"... In PAGE 11: ...roperty 1 Let G be the graph depicted on Fig. 6. We have cvs(G) = 4 and any winning monotone connected visible search strategy for G uses at least 5 searchers. 4 Conclusion A quick glance at Table1 indicates that our results combined with the previous results in this field let only one problem to be solved, as far as connected search is concerned. Namely: is the bound on the left hand side of Equation 1, i.... ..."

### Table 1: The size of the connection graphs constructed and the number of connected components

"... In PAGE 15: ... (Our heuristic algorithm for nding the SOG apos;s and the SDG apos;s is a linear algorithm with respect to the number of nodes and edges [Ngu96].) Table1 shows the size of the connection graph and the number of connected components found in the connection graph for several numerical programs. We will give more descriptions of some of these programs in Section 6.... In PAGE 17: ...Table1 require no more than one to two seconds of additional compile time on an SGI Indy workstation. 5 Parameter Mapping Due to the interprocedural nature of the algorithm, parameter mapping is important for associating formal parameters to the actual data and for summarizing the mismatch cost of an actual parameter at a call site.... ..."

### Table 1: Connected Regular Graphs

1994

"... In PAGE 4: ... This also resulted in using about 800 hours of time to complete the catalog. Table1 lists the the number of connected regular graphs generated for each catalog. (The total number of regular graphs, including disconnected ones, in each catalog can be easily infered from this table.... ..."

Cited by 1

### Table 1: Connected regular graphs.

1999

"... In PAGE 6: ...ayreuth.de/markus/reggraphs.html. From this site you can even download various lists and some drawings of regular graphs. Table1 shows results of the program for runs with given number n of vertices and degree k. It contains the number of computed regular graphs, the total number of candidates for the minimality test, the quotient of these two numbers and the CPU-times for computation on a PC Pentium Pro with 200 MHz.... ..."

Cited by 7

### 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 1 Connection graph initialization values [5] Nodes Initial Value

2001

"... In PAGE 4: ... The intuition easily extends to the escapement of an object from a thread. [5, emphasis in original] Graph Initialization Table1 lists the initial connection graph node value assignments used for escape analysis. Table 1 Connection graph initialization values [5] Nodes Initial Value... ..."

Cited by 5

### Table 1 Connection graph initialization values [5] Nodes Initial Value

"... In PAGE 4: ... The intuition easily extends to the escapement of an object from a thread. [5, emphasis in original] Graph Initialization Table1 lists the initial connection graph node value assignments used for escape analysis. Table 1 Connection graph initialization values [5] Nodes Initial Value... ..."

### Table 1. Eigenvalues, main angles and angles of connected graphs

"... In PAGE 2: ... 1. CONNECTED GRAPHS Table1 in n5b24n5d contains 30 n281 with two, 2 with three, 6 with four and 21 with n0cveverticesn29 connected graphs with n vertices where 2 n14 n n14 5: The spectrum and characteristic polynomials, factored into irreducible factors over the n0celd of rational numbers, are given for each graph. This table is taken from n5b16n5d.... In PAGE 6: ...n n5b53n5d the nonadjacentnumbers, i.e. the coen0ecients of the Z-counting polynomial , the topological indices , and the coen0ecients of the characteristic polynomial of heptahex graphs G are tabulated. n5b14n5d contains characteristic polynomials and spectra of all connected sub- graphs, having up to six vertices, of the sum of graphs P m and P n : Tables in n5b24n5d n28 Table1 n29 and n5b29n5d contain these graphs. n5b16n5d contains a table of characteristic polynomials of miscellaneous graphs.... In PAGE 8: ...265-266n29. In Table1 all connected graphs on n vertices n282 n14 n n14 5n29 are given in the same order as in Table 1 in appendix of n5b24n5d together with relevant data. Table 1 in this paper contains, for each graph, eigenvalues n28n0crst linen29, main angles n28second linen29 and vertex angle sequences refering to labels of vertices in the graph diagram... In PAGE 8: ...265-266n29. In Table 1 all connected graphs on n vertices n282 n14 n n14 5n29 are given in the same order as in Table1 in appendix of n5b24n5d together with relevant data. Table 1 in this paper contains, for each graph, eigenvalues n28n0crst linen29, main angles n28second linen29 and vertex angle sequences refering to labels of vertices in the graph diagram... In PAGE 8: ... Table 1 in this paper contains, for each graph, eigenvalues n28n0crst linen29, main angles n28second linen29 and vertex angle sequences refering to labels of vertices in the graph diagram which follows. Vertices of graphs in Table1... In PAGE 10: ...Dragon14sCvetkovin13c, MilenkoPetrin13c Table1 . n28continuedn29 9.... In PAGE 11: ...59 Table1 . n28continuedn29 17.... In PAGE 12: ...Dragon14sCvetkovin13c, MilenkoPetrin13c Table1 . n28continuedn29 25.... ..."

### TABLE II MEMORY USAGE OF DIFFERENT CONNECTION GRAPH (MB)

1999

Cited by 17