Packing arc-disjoint cycles in oriented graphs
From MaRDI portal
Publication:6126480
DOI10.1016/j.jcss.2024.103530OpenAlexW4392845024MaRDI QIDQ6126480
Ajay Saju Jacob, Deepak Rajendraprasad, Jasine Babu, R. Krithika
Publication date: 9 April 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2024.103530
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Kernel bounds for path and cycle problems
- Kernel bounds for disjoint cycles and disjoint paths
- Destroying cycles in digraphs
- The complexity ecology of parameters: An illustration using bounded max leaf number
- An improved kernelization algorithm for \(r\)-set packing
- Packing arc-disjoint cycles in bipartite tournaments
- A simplified NP-complete satisfiability problem
- Cycles in dense digraphs
- Faster fixed-parameter tractable algorithms for matching and packing problems
- An application of simultaneous diophantine approximation in combinatorial optimization
- Packing directed circuits
- Parameterized complexity of vertex colouring
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Packing and covering directed triangles
- Parametrized complexity theory.
- Packing arc-disjoint cycles in tournaments
- Integer Programming with a Fixed Number of Variables
- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs
- Intersection Theorems for Systems of Sets
- Minkowski's Convex Body Theorem and Integer Programming
- ON DISJOINT CYCLES
- Color-coding
- Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems
- Kernelization
- Approximation algorithms and hardness results for cycle packing problems
- Lossy kernelization
- On Independent Circuits Contained in a Graph
- Parameterized Algorithms
- Digraphs
