A fast and effective heuristic for the feedback arc set problem
From MaRDI portal
Publication:688447
DOI10.1016/0020-0190(93)90079-OzbMath0787.68078OpenAlexW2058702778WikidataQ59650036 ScholiaQ59650036MaRDI QIDQ688447
W. F. Smyth, Peter Eades, Xuemin Lin
Publication date: 19 May 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90079-o
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (18)
Approximations of arbitrary relations by partial orders ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The Network HHD: Quantifying Cyclic Competition in Trait-Performance Models of Tournaments ⋮ Tight Localizations of Feedback Sets ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ Computing a feedback arc set using PageRank ⋮ Extremal results on feedback arc sets in digraphs ⋮ A Generalization of the Directed Graph Layering Problem ⋮ Compact Layered Drawings of General Directed Graphs ⋮ Effective Computation of a Feedback Arc Set Using PageRank ⋮ Efficient mode enumeration of compositional hybrid systems ⋮ MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS ⋮ The minimum feedback arc set problem and the acyclic disconnection for graphs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Balanced vertex-orderings of graphs ⋮ Combinatorial algorithms for feedback problems in directed graphs ⋮ Modeling the emergence of modular leadership hierarchy during the collective motion of herds made of harems ⋮ Analysis of the equality relations for the program terms
Cites Work
This page was built for publication: A fast and effective heuristic for the feedback arc set problem
