Pages that link to "Item:Q1007586"
From MaRDI portal
The following pages link to Combinatorial algorithms for feedback problems in directed graphs (Q1007586):
Displaying 15 items.
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233) (← links)
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order (Q543787) (← links)
- Parallelism and the feedback vertex set problem (Q1111395) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Optimal segmentation of directed graph and the minimum number of feedback arcs (Q1683994) (← links)
- Capacity inverse minimum cost flow problem (Q2268762) (← links)
- Clique counting in MapReduce: algorithms and experiments (Q2828209) (← links)
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem (Q3033586) (← links)
- Computation of Renameable Horn Backdoors (Q3502704) (← links)
- On the complexity of feedback set problems in signed digraphs (Q3503560) (← links)
- Approximating minimum feedback sets and multi-cuts in directed graphs (Q5101402) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- The difficulty of beating the Taxman (Q6064847) (← links)
- Optimal schemes for combinatorial query problems with integer feedback (Q6138906) (← links)
