Dynamic parameterized feedback problems in tournaments
From MaRDI portal
Cites work
- 2-Approximating Feedback Vertex Set in Tournaments
- A 7/3-approximation for feedback vertex sets in tournaments
- A dynamic data structure for counting subgraphs in sparse graphs
- A dynamic data structure for MSO properties in graphs with bounded tree-depth
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Disproof of a conjecture of Erdös and moser on tournaments
- Dynamic data structures for parameterized string problems
- Dynamic Parameterized Problems and Algorithms
- Dynamic treewidth
- Fast dynamic graph algorithms for parameterized problems
- Fast FAST
- Faster exact and parameterized algorithm for feedback vertex set in tournaments
- Feedback vertex sets in tournaments
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 219267 (Why is no real title available?)
- scientific article; zbMATH DE number 7788388 (Why is no real title available?)
- Maintaining CMSO₂ properties on dynamic structures with bounded feedback vertex number
- On Sets of Consistent Arcs in a Tournament
- On the maximum cardinality of a consistent set of arcs in a random tournament
- On width measures and topological problems on semi-complete digraphs
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Ranking Tournaments
This page was built for publication: Dynamic parameterized feedback problems in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255460)
