the objects
  are sorted according to their number of neighbors so that the object
  with larger number of neighbors are colored first. If "S" is
  selected, the order is dynamically constructed; the object with
  smallest number of neighbors will be colored last and is
  temporarily removed from the graph. This process repeats itself
  until all objects are ordered. </td>
</tr>

<tr VALIGN=TOP NOSAVE>
<td NOSAVE><a NAME="RECOLORING_NUM_OF_ITERATIONS"></a><i>&nbsp;&nbsp;RECOLORING_NUM_OF_ITERATIONS </i></td