Kernelization for graph packing problems via rainbow matching

DOI10.1137/1.9781611977554.CH139MaRDI QIDQ6538671zbMATH OpenFDO

Authors Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH139

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs
• Breaking a graph into connected components with small dominating sets
• Subset feedback vertex set in tournaments as fast as without the subset
• Boundaried kernelization
• Subset feedback vertex set in tournaments as fast as without the subset
• Elimination distance to dominated clusters

This page was built for publication: Kernelization for graph packing problems via rainbow matching

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