Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Worst-case to expander-case reductions

From MaRDI portal
Publication:6610261
Jump to:navigation, search

DOI10.4230/LIPICS.ITCS.2023.1MaRDI QIDQ6610261

Amir Abboud, Nathan Wallheimer

Publication date: 25 September 2024





zbMATH Keywords

trianglemaximum matchingreductionscliquedominating setvertex cover4-cycleexpander graphsfine-grained complexityexpander decompositionexact and parameterized complexity


Mathematics Subject Classification ID

Theory of computing (68Qxx)








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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6610261&oldid=40162094"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 19:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki