The following pages link to Algorithms and Data Structures (Q5900778):
Displaying 7 items.
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound (Q2957516) (← links)