Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs

DOI10.1007/s00224-022-10114-8OpenAlexW4318065825MaRDI QIDQ6038707

Abhishek Sahu, Saket Saurabh

Publication date: 2 May 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-022-10114-8

zbMATH Keywords

kernelizationcycle packingalpha-bounded digraphs

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computer science (68-XX) Computability and recursion theory (03Dxx)

Cites Work

• Fundamentals of parameterized complexity
• Kernel bounds for disjoint cycles and disjoint paths
• An improved kernelization algorithm for \(r\)-set packing
• Hamiltonian circuits determining the order of chromosomes
• Packing directed circuits
• Graph minors. XIII: The disjoint paths problem
• Parametrized complexity theory.
• Packing arc-disjoint cycles in tournaments
• Nonconstructive tools for proving polynomial-time decidability
• ON DISJOINT CYCLES
• Packing cycles in undirected graphs
• Packing Arc-Disjoint Cycles in Tournaments
• Packing Cycles Faster Than Erdos--Posa
• On Independent Circuits Contained in a Graph
• Parameterized Algorithms
• Unnamed Item
• Unnamed Item