Packing Arc-Disjoint Cycles in Tournaments
From MaRDI portal
Publication:5092386
DOI10.4230/LIPIcs.MFCS.2019.27OpenAlexW4288255103MaRDI QIDQ5092386
Stéphane Bessy, Marin Bougeret, Abhishek Sahu, Jocelyn Thiebaut, Meirav Zehavi, R. Krithika, Saket Saurabh
Publication date: 21 July 2022
Full work available at URL: https://hal.archives-ouvertes.fr/hal-02277436
Related Items (3)
Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs ⋮ Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs ⋮ On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
Cites Work
- Fundamentals of parameterized complexity
- Packing edge-disjoint triangles in regular and almost regular tournaments
- Kernel bounds for disjoint cycles and disjoint paths
- Kernels for feedback arc set in tournaments
- An improved kernelization algorithm for \(r\)-set packing
- A simplified NP-complete satisfiability problem
- The complexity of Kemeny elections
- Cycles in dense digraphs
- The directed subgraph homeomorphism problem
- Hamiltonian circuits determining the order of chromosomes
- Which problems have strongly exponential complexity?
- Parametrized complexity theory.
- Packing Triangles in Regular Tournaments
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Fast FAST
- On the Complexity of Timetable and Multicommodity Flow Problems
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- ON DISJOINT CYCLES
- Color-coding
- Packing cycles in undirected graphs
- Kernelization
- Approximation algorithms and hardness results for cycle packing problems
- Packing Cycles Faster Than Erdos-Posa
- Triangle packing in (sparse) tournaments: approximation and kernelization
- On Independent Circuits Contained in a Graph
- Ranking Tournaments
- Parameterized Algorithms
- Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Packing Arc-Disjoint Cycles in Tournaments
