Abstract
In the first part of the paper, we determine the strict upper bound on the size of the GS-DAG with respect to the size of the UID being solved. In the second part we introduce a new type of GS-DAG multinode, which reduces the number of edges of the GS-DAGs significantly.