Parameterized complexity of disconnected matchings

DOI10.1007/978-3-031-92935-9_15MaRDI QIDQ6902106zbMATH OpenFDO

Authors Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_15

zbMATH Keywords

disconnected matchingexact exponential algorithmkernelizationparameterized complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• $\mathcal{P}$-matchings Parameterized by Treewidth
• A faster algorithm for vertex cover parameterized by solution size
• Degenerate matchings and edge colorings
• Disconnected matchings
• Exact exponential algorithms.
• Fourier meets M\"{o}bius: fast subset convolution
• Generalized subgraph-restricted matchings in graphs
• Graph theory
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Induced matchings
• Kernelization Lower Bounds by Cross-Composition
• Parameterized algorithms
• Parameterized complexity of finding regular induced subgraphs
• Parametrized complexity theory.
• The parameterized complexity of the induced matching problem
• Uniquely restricted matchings

This page was built for publication: Parameterized complexity of disconnected matchings

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