Figure 9 demonstrates this transformation for two real-life CF-UGs.
the dependencies in U are simply encoded in the edges of G. if i is the node of G corresponding to t i , an edge from i to j in G means that l q j (l 0 , if j = 0) depends on l q i in U.