Electrical and Computer Engineering Commons^™

Summary Of Feedback Edge Set Papers, Jonathan Johnson

Faculty Publications

The problem of finding a set of edges F from a directed graph G = (V,E) such that the graph G0 = (V,E − F) contains no cycles is known as the feedback edge set (FES) problem or the feedback arc set problem. A related problem is the minimum feedback edge set problem, in which the feedback edge set F must be minimal. The feedback edge set problem has application in applying a common reliability technique called triple modular redundancy to FPGA circuit designs where configuration memory scrubbing is employed [1].