### Table 1: Area bounds for drawing arbitrary binary trees.

1999

"... In PAGE 1: ...0. Order-preserving. The curve from the parent to the left child is to the left of the curve from the parent to the right child. Table1 summarizes the known results for various com- binations of the four criteria. The two O(n log n) area bounds in the table, due to Crescenzi, Di Battista, and Piperno [2] and Garg, Goodrich, and Tamassia [6], were obtained by simple recursive algorithms and proved to be tight in the worst case for their corresponding types of drawings.... ..."

Cited by 5

### TABLE 6. Tree Structures of Concurrent Actions Correlated with Depicting Drawings (Dc)

2001

Cited by 1

### Table 2. Number of rearrangements on derived evolutionary trees

in References

2007

"... In PAGE 3: ... The results are shown in Table 1 (see also Supplemental material). The solutions ob- tained in the various runs are very consistent both in terms of the number of rearrangements on the edges of the recovered scenario (see Table2 ) and of the observed chromosomal associations in the putative ancestors (see Table 3). In the rest of this section, we present a detailed description of the results on run gene7, which allows for genes to be merged into the same block when there are up to two intervening genes per species.... ..."

### Table 1: Summary of the results on minimum area drawings of c-connected clustered trees.

### Table 3. Times required for layout drawing and interconnect tree extraction in SysRel.

### Table 1: Drawing Performance. We show two performance measures for our drawing and culling algorithm: the time to draw the scene with vs. without culling, and the number of nodes drawn (with culling). Our new method achieves a near-constant drawing time for any size tree. Note that for the largest tree, we are not able to enqueue all nodes in the tree as the size of the vector grows too large for the applica- tion to t in main memory.

"... In PAGE 5: ... Both drawing and culling are now based entirely on tree topology, and do not depend on any properties of Grid- Cells. In addition, there is now little bene t to drawing items in order of importance , because our drawing algo- rithm requires a nearly constant amount of work after the dataset size surpass a particular point ( Table1 ). We elimi- nate the extreme performance penalty of updating a sorted queue of items to be drawn, instead using a simple FIFO.... ..."

### Table 1.8: The time complexity of some fundamental graph drawing problems: trees. We denote with k a xed constant such that k 1. Class of Graphs Problem Time Complexity Source tree draw as the Euclidean minimum spanning tree of a set of points in the plane

1997

Cited by 14

### Table 12. Interaction of lexical, syntactic and semantic information in KPs.

2004

"... In PAGE 10: ... Semantic information in KPs. KP Semantic Link Semantic category Expected variations is a amp;home for Synonymy Home house, living-place, roof are ^colour Hypernym Colour brown, blue, green is a ^time when Hypernym Time period, moment is an amp;amount of Synonymy Amount Quantity Although each kind of token has a value when used alone Table12 shows some possible interactions, and this is that type of search that would include lexical, syntac- tic and semantic information, providing a quite flexible way of getting access to ... ..."

### TABLE 44.3.3 The time complexity of some fundamental graph drawing problems: trees. k is a xed constant k 1. CLASS OF GRAPHS PROBLEM TIME COMPLEXITY tree draw as the Euclidean minimum span- ning tree of a set of points in the plane NP-hard

### Table 1: Input Variables (Profiling Data, Tree Statistics and Derived Variables)

"... In PAGE 13: ... We will see that the absolute level of the target page utilization does not affect the significance of the performance metrics for the comparison of nodes within the tree structure. optimal clustering, which minimizes the total number of relevant page accesses (at the leaf level, those are accesses to pages containing items of the result set of a query, see Table1 ) for the entire workload. A tree with these properties will execute the investigated workload with the minimal number of page accesses.... ..."