### Table 8: Percent of hierarchical and linear Strategies Usual Arrangement Unusual Arrangement

"... In PAGE 4: ... Lastly, on the third line, we find the word quot; Tourism quot;, quot; Abundant quot; and quot; Rare quot;. Table8 presents the number of hierarchical and linear Strategies according to the arrangement. Table 8: Percent of hierarchical and linear Strategies Usual Arrangement Unusual Arrangement... ..."

### Table 8: Percent of hierarchical and linear Strategies Usual Arrangement Unusual Arrangement

"... In PAGE 4: ... Lastly, on the third line, we find the word quot; Tourism quot;, quot; Abundant quot; and quot; Rare quot;. Table8 presents the number of hierarchical and linear Strategies according to the arrangement. Table 8: Percent of hierarchical and linear Strategies Usual Arrangement Unusual Arrangement... ..."

### Table 2. Experimental results in linear arrangement problem

### Table 8. Ordered arrangements of two populations

"... In PAGE 21: ... We conclude by looking at the vectors assigned index values at or near the middle index value to determine whether the proportional distributions seem reasonable in relation to the middle index value. Synthetic data was generated to represent the proportional distribution of tuples in summaries, resulting in the series of vectors shown in Table8 , where index values for 16,928 vectors (i.e.... In PAGE 21: ...Histograms of the absolute frequencies of the index values generated for the vectors in Table8 were generated for each measure. Again, due to space limitations, we cannot show all of these histograms.... In PAGE 22: ...he middle index value (i.e., (minimum + maximum)/2), and less than or greater than the median (i.e., the value for which 50% of the generated index values lie below and 50% lie above). Again, we analyze the index values generated from the two populations shown in Table8 , with the results shown in Tables 10 and 11. In Tables 10 and 11, the Minimum and Maximum columns describe the minimum and maximum index values generated by each measure, respectively, the Middle column describes the middle index value, the lt; Middle and gt; Middle columns... ..."

Cited by 2

### Table 1: Layout problems: de nitions and related results.

1998

"... In PAGE 3: ... Given a graph G and a layout apos; on G, let us de ne: L(i; apos;; G) = fu 2 V (G) : apos;(u) ig R(i; apos;; G) = fu 2 V (G) : apos;(u) gt; ig (i; apos;; G) = fuv 2 E(G) : u 2 L(i; apos;; G) ^ v 2 R(i; apos;; G)g (i; apos;; G) = fu 2 L(i; apos;; G) : 9v 2 R(i; apos;; G) : uv 2 E(G)g (uv; apos;; G) = j apos;(u) ? apos;(v)j where uv 2 E(G): The problems we consider are Bandwidth (Bandwidth), Minimum Linear Arrange- ment (MinLA), Minimum Cut (MinCut), Minimum Sum Cut (MinSumCut), Vertex Sep- aration (VertSep) and Bisection (Bisection). The goal of these problems is to minimize their measure, which is given in Table1 . For example, the MinLA problem asks for a layout that minimizesla( apos;; G) = X uv2E(G) (uv; apos;; G) for all possible layouts.... In PAGE 3: ... We denote as minla(G), minsc(G), minbw(G), mincut(G), minvs(G) and minbis(G) the optimal (minimal) values of the respective problems. Table1 also reviews some interesting related results on the problems in mind, focussing on (non-)approximation results and subclasses of problems that have e cient solution, pos- sibly in parallel. Geometric random graphs.... ..."

Cited by 1

### Table 2. Table 2: Linear kaleidoscope arrangements, listed by symbol from [7]; k is the symmetry of the arrangement and 1 means the line at in nity is included. Where determinable, the type of the arrangement is indicated: 6 = indicates a two-beam con guration with wr 6 = wg; = indicates a two-beam con guration with wr = wg; indicates a three-beam diamond arrangement; and x indicates a three-beam interlaced arrangement.

"... In PAGE 25: ... Figure 21 shows a similar four-beam pseudoline arrangement with k = 8. There are several four-beam (and one ve-beam) linear simplicial arrangements, indicated in Table2 , but no general treatment is known. I propose the following: Conjecture 1.... ..."

### Table 1. The test suit of Petit [19]. For each graph the table shows the cost of the linear arrangement computed by Petit using simulated annealing (SA).

2002

"... In PAGE 20: ... We have tested it on a test suite of graphs compiled by Petit [19], chosen so as to represent several graph families. Table1 describes the graphs in the set. Petit computed linear arrangements of these graphs using many algorithms.... ..."

Cited by 20

### Table 1: Minimum Distances of the new linear codes over GF(3).

"... In PAGE 2: ... 2 The New Codes In this section, we present the new codes. The parameters of these codes are given in Table1 , along with the minimum distances, dbr [1], of the previously best known codes for comparison. Theorem 1 : There exist quasi-cyclic codes ( = 1) with parameters: [104; 9; 60]; [130; 9; 76]; [143; 9; 85]; [156; 9; 93]; [65; 13; 30; 3]; [56,14,24;3]; [60; 14; 25; 3]; [60; 15; 24; 3]; [64; 16; 26 : 3]; [68; 17; 27; 3]; [72,17,29;3]; [134; 17; 64; 3]; [153; 17; 74; 3]; [54; 18; 19; 3]; [72; 18; 28; 3]:... ..."

### Table 1: Minimum Distances of the new linear codes over GF(3).

"... In PAGE 2: ... 2 The New Codes In this section, we present the new codes. The parameters of these codes are given in Table1 , along with the minimum distances, dbr [1], of the previously best known codes for comparison. Theorem 1 : There exist quasi-cyclic codes ( = 1) with parameters: [104; 9; 60]; [130; 9; 76]; [143; 9; 85]; [156; 9; 93]; [65; 13; 30; 3]; [56,14,24;3]; [60; 14; 25; 3]; [60; 15; 24; 3]; [64; 16; 26 : 3]; [68; 17; 27; 3]; [72,17,29;3]; [134; 17; 64; 3]; [153; 17; 74; 3]; [54; 18; 19; 3]; [72; 18; 28; 3]:... ..."