A fast and effective heuristic for the feedback arc set problem

1993/10/01 by Peter Eades, Xuemin Lin, W.F. Smyth · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Cardinality (data modeling) #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Constant (computer programming) #Digraph #Directed graph #Discrete mathematics #Feedback arc set #Graph #Heuristic #Interconnection Networks and Systems #Line graph #Mathematical optimization #Mathematics

paper · doi:10.1016/0020-0190(93)90079-o

crossref issued 1993/10/01 · crossref published 1993/10/01 · crossref published-print 1993/10/01 · openalex publication_date 1993/10/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/25 · openalex updated_date 2026/07/25

Citations

• Optimally ranking unrankable tournaments
• Inconsistencies in a schedule of paired comparisons
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Reducibility among Combinatorial Problems

Cited by

• Efficient Shapley values computation for Boolean network models of gene regulation
• Feedback arc set [wikipedia]