Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs

DOI10.1007/978-3-030-50026-9_27MaRDI QIDQ5042259zbMATH OpenOpenAlexFDO

Authors Abhishek Sahu, Saket Saurabh

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50026-9_27

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Kernelization of arc disjoint cycle packing in -bounded digraphs
• Packing arc-disjoint cycles in tournaments
• Packing Arc-Disjoint Cycles in Tournaments
• Packing arc-disjoint cycles in bipartite tournaments
• Kernelization of cycle packing with relaxed disjointness constraints

Cites work

• An improved kernelization algorithm for \(r\)-set packing
• Edge-disjoint paths in digraphs with bounded independence number
• Fundamentals of parameterized complexity
• Graph minors. XIII: The disjoint paths problem
• Graph theory
• Hamiltonian circuits determining the order of chromosomes
• scientific article; zbMATH DE number 7650395 (Why is no real title available?)
• Kernel bounds for disjoint cycles and disjoint paths
• Nonconstructive tools for proving polynomial-time decidability
• ON DISJOINT CYCLES
• On Independent Circuits Contained in a Graph
• Packing arc-disjoint cycles in bipartite tournaments
• Packing Arc-Disjoint Cycles in Tournaments
• Packing cycles faster than Erdős-Pósa
• Packing cycles in undirected graphs
• Packing directed circuits
• Parameterized algorithms
• Parametrized complexity theory.
• The parameterized complexity of cycle packing: indifference is not an issue

Cited in

(1)

• Kernelization of arc disjoint cycle packing in -bounded digraphs

This page was built for publication: Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042259)