Induced matching below guarantees: average paves the way for fixed-parameter tractability

DOI10.4230/LIPICS.STACS.2023.39MaRDI QIDQ6615147

Tomohiro Koana

Publication date: 8 October 2024

zbMATH Keywords

induced matchingparameterized complexityGallai-Edmonds decompositionbelow guarantees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Parameterized results on acyclic matchings with implications for related problems

This page was built for publication: Induced matching below guarantees: average paves the way for fixed-parameter tractability

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