Solving edge clique cover exactly via synergistic data reduction

DOI10.4230/LIPICS.ESA.2023.61MaRDI QIDQ6657022zbMATH OpenFDO

Authors Anthony Hevia, Benjamin Kallus, Summer Mcclintic, Samantha Reisner, Darren Strash, Johnathan Wilson

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.61

zbMATH Keywords

data reductiondegeneracyedge clique coververtex clique cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Conceptual clique sampling frameworks to design solution algorithms for the edge clique cover problem
• Edge clique partition and cover beyond independence

This page was built for publication: Solving edge clique cover exactly via synergistic data reduction

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