On feedback problems in digraphs
From MaRDI portal
Recommendations
Cited in
(32)- Parallelism and the feedback vertex set problem
- On enumerating all minimal solutions of feedback problems
- Polynomial kernels for deletion to classes of acyclic digraphs
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- Polynomial time algorithms for tracking path problems
- Component order connectivity in directed graphs
- A quadratic vertex kernel for feedback arc set in bipartite tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
- Open problems around exact algorithms
- Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms
- Packing arc-disjoint cycles in tournaments
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Tournaments and Semicomplete Digraphs
- A spin glass approach to the directed feedback vertex set problem
- On the complexity of feedback set problems in signed digraphs
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- On feedback problems in planar digraphs
- Improved bounds for minimal feedback vertex sets in tournaments
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- Tight localizations of feedback sets
- ON PRIMITIVITY OF MIXING DIGRAPHS ASSOCIATED WITH 2-FEEDBACKS SHIFT REGISTERS
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
- Safe sets and in-dominating sets in digraphs
- A 7 / 3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams
- Kernels for feedback arc set in tournaments
- A (2+)-factor approximation algorithm for split vertex deletion
- The PACE 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set
- Exact localisations of feedback sets
- Dynamic parameterized feedback problems in tournaments
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Parameterized complexity of d-hitting set with quotas
- Feedback arc set in bipartite tournaments is NP-complete
This page was built for publication: On feedback problems in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694754)