Keywords
feedback, edge, edge set, arc set
Abstract
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].
BYU ScholarsArchive Citation
Johnson, Jonathan, "Summary of Feedback Edge Set Papers" (2010). Faculty Publications. 105.
https://scholarsarchive.byu.edu/facpub/105
Document Type
Peer-Reviewed Article
Publication Date
2010-04-22
Permanent URL
http://hdl.lib.byu.edu/1877/2318
Language
English
College
Ira A. Fulton College of Engineering and Technology
Department
Electrical and Computer Engineering
Copyright Status
© 2010 Jonathan Johnson
Copyright Use Information
http://lib.byu.edu/about/copyright/