### Table 6. Sparse graphs

1996

"... In PAGE 17: ... We increased the number of nodes and de ned the number of edges to be 1.5 times the number of nodes and 2 times jV j (see Table6 ) for the unweighted case. Computational studies on randomly generated unweighted graphs showed that our algorithm can solve almost all instances of graphs with at most 40 edges.... ..."

Cited by 34

### Table 6. Sparse graphs

1996

"... In PAGE 17: ... We increased the number of nodes and de ned the number of edges to be 1.5 times the number of nodes and 2 times jV j (see Table6 ) for the unweighted case. Computational studies on randomly generated unweighted graphs showed that our algorithm can solve almost all instances of graphs with at most 40 edges.... ..."

Cited by 34

### Table 5. Sparse graphs

1993

"... In PAGE 10: ... We increased the number of nodes and de ned the number of edges to be 1.5 times the number of nodes and 2 times jV j (see Table5 ) for the unweighted case.... ..."

Cited by 10

### Table 5. Sparse graphs

1993

"... In PAGE 10: ... We increased the number of nodes and de ned the number of edges to be 1.5 times the number of nodes and 2 times jV j (see Table5 ) for the unweighted case.... ..."

Cited by 10

### Table 2: Sparse graph terminology used in this paper.

1992

"... In PAGE 7: ... The representation problem takes as input a sparse graph G and returns as output a sparse graph H that represents G and has lower dimension if this is possible. Table2 summarizes the notation and terminology related to sparseness used in this paper. While the de nitions in this section are made for families of sparse graphs, they can be interpreted in terms of matroids and rigidity theory.... ..."

Cited by 2

### Table 3: Sparse Graphs (Pentium Pro, seconds)

1999

"... In PAGE 7: ... This requires slightly less overhead than computing the strongly connected components, and appears to work adequately in practice. 2 g f + + + + + + - - - - e T T 1 Figure 1: Constraints on Dual Change Values A computational comparison of the single-tree, multiple-tree, and the variable- quot; meth- ods is given in Table3 . The problem instances are sparse graphs derived from geometric... ..."

Cited by 43