scientific article; zbMATH DE number 825126
From MaRDI portal
Publication:4858141
Recommendations
Cited in
(17)- Combinatorial algorithms for feedback problems in directed graphs
- Constrained graph layout by stress majorization and gradient projection
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Tight upper bounds for minimum feedback arc sets of regular graphs
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
- DTCPP - A heuristic program for testing decyclization in directed graphs and its isomorphic image by using combinatorial approach
- scientific article; zbMATH DE number 1526336 (Why is no real title available?)
- The feedback arc set problem with triangle inequality is a vertex cover problem
- A practical type theory for symmetric monoidal categories
- An exact method for the minimum feedback arc set problem
- A fast and effective algorithm for the feedback arc set problem
- The Minimal Feedback Arc Set Problems*
- Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
- Efficient heuristics to compute minimal and stable feedback arc sets
- A fast and effective heuristic for the feedback arc set problem
- Finding small feedback arc sets on large graphs
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858141)