10 4 in this paper we cut edges in a different way using circuit retiming algorithms so as to minimize both the longest dependence path in the acyclic graph and the number of edges in the acyclic graph 
