Combinatorial algorithms for feedback problems in directed graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432770 (Why is no real title available?)
- scientific article; zbMATH DE number 3869066 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1261808 (Why is no real title available?)
- scientific article; zbMATH DE number 1182761 (Why is no real title available?)
- scientific article; zbMATH DE number 825126 (Why is no real title available?)
- A fast and effective heuristic for the feedback arc set problem
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Approximations for the maximum acyclic subgraph problem
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
- On enumerating all minimal solutions of feedback problems
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Packing directed circuits fractionally
Cited in
(24)- Optimal schemes for combinatorial query problems with integer feedback
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
- Computation of Renameable Horn Backdoors
- Tight upper bounds for minimum feedback arc sets of regular graphs
- Parallelism and the feedback vertex set problem
- scientific article; zbMATH DE number 2069436 (Why is no real title available?)
- Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)
- On the complexity of feedback set problems in signed digraphs
- The difficulty of beating the Taxman
- The feedback arc set problem with triangle inequality is a vertex cover problem
- 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
- Clique counting in MapReduce: algorithms and experiments
- scientific article; zbMATH DE number 1762085 (Why is no real title available?)
- The feedback arc set problem with triangle inequality is a vertex cover problem
- Optimal segmentation of directed graph and the minimum number of feedback arcs
- The Minimal Feedback Arc Set Problems*
- On enumerating all minimal solutions of feedback problems
- scientific article; zbMATH DE number 3876618 (Why is no real title available?)
- DTCPP - A heuristic program for testing decyclization in directed graphs and its isomorphic image by using combinatorial approach
- Capacity inverse minimum cost flow problem
- scientific article; zbMATH DE number 219267 (Why is no real title available?)
- 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: Combinatorial algorithms for feedback problems in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007586)
