### Table 1: Parameters for Generating Network Graphs

2002

"... In PAGE 12: ...fundamental characteristics of the Internet, but we hope the random networks and the geographic networks represent some degree of variances that allow us to examine the behavior of our methodology. Throughout the section, readers are referred to Table1 for the interpretations of the parameters. Unless otherwise mentioned, we use the following default parameter values: the random graph scale is 100 by 100 units; the probability of network interconnection is 1.... ..."

Cited by 16

### Table 1. Characteristics of randomly generated graphs.

1997

"... In PAGE 6: ... For each network size, 40 graphs were generated randomly, and two simulation sessions were conducted on each graph. Table1 shows the characteristics of the graphs generated. In the table, the symbol Tf denotes the worst-case time to perform a ooding operation in a given network.... ..."

Cited by 4

### Table 1. Characteristics of randomly generated graphs.

1997

"... In PAGE 6: ... For each network size, 40 graphs were generated randomly, and two simulation sessions were conducted on each graph. Table1 shows the characteristics of the graphs generated. In the table, the symbol Tf denotes the worst-case time to perform a ooding operation in a given network.... ..."

Cited by 4

### Table 1. Characteristics of randomly generated graphs.

1997

"... In PAGE 17: ... For each network size, 40 graphs were generated randomly, and two simulation sessions were conducted on each graph. Table1 shows the characteristics of the graphs generated. In the table, maximum, minimum, and mean values are averages over the 40 graphs of the same... ..."

Cited by 4

### TABLE 1 Local Network Positions

2005

Cited by 2

### Table 2: Summary of key properties of the test networks. Some other (non-road) graphs of similar sizes are shown for comparison. The number of circuits is an interesting measure of graph complexity for instance.

"... In PAGE 3: ... We do not consider this reachability index for our bi-directional trunk road networks however. Table2 summarises these static graph metrics for other road network data sets and some other graphs. It is also possible to do a sensitivity or perturbation analysis using these metrics.... In PAGE 4: ... In general we are severely limited in use of the algorithm for counting or enumerating the elementary circuits due to its intractability for anything but small networks of around 60 vertices and mean degree of around 6. 4 Model Network Results Table2 summarises the static properties of the road networks we analyse in this paper along with some other simple graphs of similar size for comparison. It is worth drawing attention to the simple lattice networks generated for comparisons.... ..."

### Table 1: Graph Properties Studied under Recursive Generation

"... In PAGE 32: ... Table1 lists 42 graph properties believed to be formulated in R-languages in [7] correctly and completely. These properties were a cross-section selected from the indices of the benchmark texts.... In PAGE 32: ...dequate. There is no formal proof. Is the R-language representation applicable to labeled graphs and networks? Extensions to R-languages [7] have included a register used as a counter, and labels on both vertices and edges. Some of the properties of Table1 are written in those extended languages. Thus R-languages appear applicable to labeled graphs and networks.... ..."

### Table 2 Clustering coeSOcients of the market graph

2004

### Table 2: Graph generation statistics

1997

"... In PAGE 14: ...13 about 350,000 states. Table2 gives the graph generation time and size, before and after minimization, for some scenarios.... ..."

Cited by 1

### Table 1. The Efficient Graph Clustering Algorithm.

2000

Cited by 20