A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Two edges el and e2 of an undirected graph are cycle-equivalent iff all cycles that contain el also contain e2, i.e., iff el and e2 are a cut-edge pair. The cycle-equivalence classes of the control-flow graph are used in optimizing compilers to speed up ezasting control-flow and data-flow algorithms. While the cycle-equivalence classes can be computed in linear time, we present the first fully dynamic algorithm for maintaining the cycle-equivalence relation. I n an nnode graph OUT datadoi:10.1109/sfcs.1994.365718 dblp:conf/focs/Henzinger94 fatcat:bq7fbnh2enhzxgb4ienmuvfo3e