A fast and effective heuristic for the feedback arc set problem
From MaRDI portal
(Redirected from Publication:688447)
Recommendations
Cites work
- scientific article; zbMATH DE number 432770 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3329639 (Why is no real title available?)
- On Sets of Consistent Arcs in a Tournament
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Optimal ranking of tournaments
- Optimally ranking unrankable tournaments
Cited in
(32)- Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
- Modeling the emergence of modular leadership hierarchy during the collective motion of herds made of harems
- Tight localizations of feedback sets
- Finding small feedback arc sets on large graphs
- scientific article; zbMATH DE number 1526336 (Why is no real title available?)
- Combinatorial algorithms for feedback problems in directed graphs
- Approximations of arbitrary relations by partial orders
- Exact localisations of feedback sets
- The network HHD: quantifying cyclic competition in trait-performance models of tournaments
- Compact layered drawings of general directed graphs
- Efficient mode enumeration of compositional hybrid systems
- A fast and effective algorithm for the feedback arc set problem
- Effective Computation of a Feedback Arc Set Using PageRank
- Feedback arc set. A history of the problem and algorithms
- A generalization of the directed graph layering problem
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
- An exact method for the minimum feedback arc set problem
- Asymptotic lower bounds for the feedback arc set problem in random graphs
- Analysis of the equality relations for the program terms
- Balanced vertex-orderings of graphs
- Optimal segmentation of directed graph and the minimum number of feedback arcs
- Efficient heuristics to compute minimal and stable feedback arc sets
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Minimal and stable feedback arc sets and graph centrality measures
- Computing a feedback arc set using PageRank
- scientific article; zbMATH DE number 219267 (Why is no real title available?)
- scientific article; zbMATH DE number 139781 (Why is no real title available?)
- Extremal results on feedback arc sets in digraphs
- scientific article; zbMATH DE number 825126 (Why is no real title available?)
- The minimum feedback arc set problem and the acyclic disconnection for graphs
This page was built for publication: A fast and effective heuristic for the feedback arc set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688447)
