Worst-case to expander-case reductions

DOI10.4230/LIPICS.ITCS.2023.1MaRDI QIDQ6610261zbMATH OpenFDO

Authors Amir Abboud, Nathan Wallheimer

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.1

zbMATH Keywords

4-cyclecliquedominating setexact and parameterized complexityexpander decompositionexpander graphsfine-grained complexitymaximum matchingreductionstrianglevertex cover

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Worst-case to expander-case reductions: derandomized and generalized

This page was built for publication: Worst-case to expander-case reductions

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