### Table 2. Parameterizations of the graph search problem.

2000

Cited by 74

### Table 2. Parameterizations of the graph search problem.

2000

Cited by 74

### Table 2 Clustering coeSOcients of the market graph

2004

### Table 2 Algorithms for graph matching

1999

"... In PAGE 10: ... The experimental conditions are summarised in Table 2. Each of the algorithms listed in Table2 , except HC, was run 100 times. Since HC is deterministic, it was only run once per graph.... ..."

### Table 1: Event probabilities for causal structures Event Graph 0 Graph 1 Graph 2

2004

Cited by 4

### Table 1: Graphs used in testing graph

1997

"... In PAGE 11: ... In the remainder of this section, we denote the subgraph that resulted by selecting x percent of the edges uniformly at random by Gx. Some statistics for graphs we used are shown in Table1 . \Connected node pairs quot; are the number of node pairs (s; t) such that bdp(Gx; b; s; t) gt; 0.... In PAGE 11: ... Equations for each of these values is given at the bottom of Table 2. Note that these measures pertain only to those pairs of nodes that are multiply connected, which according to Table1 is the vast minority of node pairs. On the remaining vast majority of node pairs, each of the algorithms is guaranteed to return a true maximum set of disjoint paths (of cardinality zero or one).... ..."

Cited by 29

### Table 9: Characteristics of various graph partitioning algorithms.

1998

"... In PAGE 21: ...ot available. For the sake of simplicity, we have chosen to represent each property in terms of a small discrete scale. In absence of extensive data, we could not have done any better anyway. In Table9 we show three different variations of spectral partitioning [47, 46, 26, 2], the multilevel partitioning described in this paper, the levelized nested dissection [11], the Kernighan-Lin partition [31], the coordinate nested... In PAGE 22: ...Table 9: Characteristics of various graph partitioning algorithms. For each graph partitioning algorithm, Table9 shows a number of characteristics. The first column shows the number of trials that are often performed for each partitioning algorithm.... In PAGE 22: ... Others only require the set of vertices and edges connecting them. The third column of Table9 shows the relative quality of the partitions produced by the various schemes. Each additional circle corresponds to roughly 10% improvement in the edge-cut.... In PAGE 23: ... First, it captures global structure through the process of coarsening [27], and second, it captures global structure during the initial graph partitioning by performing multiple trials. The sixth column of Table9 shows the relative time required by different graph partitioning schemes. CND, inertial, and geometric partitioning with one trial require relatively small amount of time.... In PAGE 23: ... On the other hand, multilevel graph partitioning requires moderate amount of time, and produces partitions of very high quality. The degree of parallelizability of different schemes differs significantly and is depicted by a number of triangles in the seventh column of Table9 . One triangle means that the scheme is largely sequential, two triangles means that the scheme can exploit a moderate amount of parallelism, and three triangles means that the scheme can be parallelized quite effectively.... ..."

Cited by 495