### Table 3. Results using Colour Degree

### Table 3. Results using Colour Degree

### TABLE 14. Mapping of dynamic_state to colours

### Table 2. Distribution of dynamic de- grees for graphs with average degree 3

"... In PAGE 9: ... The dynamic degrees allow us to establish non-trivial upper bounds on the independence number of the input-graph. The dynamic degree distributions with respect to Greedy for random average degree 3 graphs are shown in Table2 . Tables Tables 3, 4 and 5 give the corresponding distributions for average degrees 4, 5 and 6 respectively.... ..."

### Table 2. Distribution of dynamic de- grees for graphs with average degree 3

"... In PAGE 9: ... The dynamic degrees allow us to establish non-trivial upper bounds on the independence number of the input-graph. The dynamic degree distributions with respect to Greedy for random average degree 3 graphs are shown in Table2 . Tables Tables 3, 4 and 5 give the corresponding distributions for average degrees 4, 5 and 6 respectively.... ..."

### Table 2. Distribution of dynamic de- grees for graphs with average degree 3

"... In PAGE 9: ... The dynamic degrees allow us to establish non-trivial upper bounds on the independence number of the input-graph. The dynamic degree distributions with respect to Greedy for random average degree 3 graphs are shown in Table2 . Tables Tables 3, 4 and 5 give the corresponding distributions for average degrees 4, 5 and 6 respectively.... ..."

### Table 2: A comparison of the dynamic R-tree variants.

1997

"... In PAGE 7: ... The main di erences between the R-tree and its variants are in the parameters used in the tree building algorithm and the shape of the bounding envelopes of its nodes (see gure 5 and 6). Some of the most successful known variants of the dynamic R-tree and their parameters are listed in Table2 (the static variants will be discussed in subsection 2.... In PAGE 7: ...n Table 2 (the static variants will be discussed in subsection 2.2.2). All the variants listed in Table2 use a data dependent split heuristics. A discussion about split heuristics can be found in (Henrich and Six, 1991).... ..."

Cited by 1