### Table 2: Time (secs) to generate codings for planar graphs

"... In PAGE 9: ... We varied the total number of nodes (real and virtual) from 40,000 to 100,000. Table2 shows that it takes less than 3 seconds to process 90000 nodes (real and virtual) with approximately 180000 edges. This implies that even for large road networks, we can find all the cuts in extremely short order.... ..."

### Table 1.7: The time complexity of some fundamental graph drawing problems: planar graphs and digraphs.

1997

Cited by 14

### TABLE 44.3.2 The time complexity of some fundamental graph drawing problems: planar graphs and digraphs.

### Table 1 Approximation algorithms for the Vertex Cover Problem

2006

"... In PAGE 3: ... Several approximation algorithms have been proposed for the Unweighted and Weighted Versions of the Vertex Cover Problem. We list some of them in Table1 . We decided to implement these algorithms because of their simplicity and performance guarantees.... ..."

### Table 1 summarizes the current status of the newly formulated problem of colored simultaneous embedding. A check indicates that it is always possible to simultaneously embed the type of graphs, a a23 indicates that it is not always possible, and a ? indicates an open problem.

2007

"... In PAGE 11: ... Table1 . k-colored simultaneous embeddings: results and open problems.... ..."

Cited by 3

### Table 1 summarizes the current status of the newly formulated problem of colored simultaneous embedding. A check indicates that it is always possible to simultaneously embed the type of graphs, a a23 indicates that it is not always possible, and a ? indicates an open problem.

2007

"... In PAGE 11: ... Table1 . k-colored simultaneous embeddings: results and open problems.... ..."

Cited by 3

### Table 1.1 Summary of NP- and #P-hardness results for planar instances. The third column summarizes the decision complexity of the problems while the fourth column summarizes the complexity of the counting versions. A star (*) denotes a result obtained in this paper. The numbers in square brackets are the references where the corresponding results are proved.

### Table 1: examined algorithms and op count PACK [2]. Figure 2 gives the execution times depending on the problem sizes on a Sun SPARCstation 10. The dashed lines of the model approximate the observed timings fairly well.

1996

Cited by 26

### Table 4: Results for the vertex packing problem.

1996

"... In PAGE 29: ...he graph between 0.1 and 0.9. The code used by the authors was limited in the sense that the cutting plane algorithm was run only in the root node, and that only primitive branching rules were available. In Table4 we report the results for the 0.2 density instances.... ..."

Cited by 4

### Table 20 . Approximate computation times for the double Mach re ection problem.

"... In PAGE 110: ...5. Cost comparison of the schemes Table20 shows approximate computing times for the schemes with piece-wise parabolic reconstruction as applied to the double Mach re ection problem. All numbers are normalized by the computing time of the ADER3-AD scheme.... ..."