The algorithmic complexity of the paired matching problem

DOI10.1007/978-3-031-46826-1_1MaRDI QIDQ6899210zbMATH OpenFDO

Authors Ruben F. A. Verhaegh

Publication date 17 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-46826-1_1

zbMATH Keywords

minimum paired matchingparameterized complexity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• Exact matching in graphs of bounded independence number
• Faster fixed-parameter tractable algorithms for matching and packing problems
• Kernel bounds for path and cycle problems
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Node-and edge-deletion NP-complete problems
• NP-completeness of some generalizations of the maximum matching problem
• Parameterized algorithms
• Parameterized complexity of finding regular induced subgraphs
• Paths, Trees, and Flowers
• Quadratic vertex kernel for rainbow matching
• The complexity of restricted spanning tree problems
• The complexity of theorem-proving procedures

This page was built for publication: The algorithmic complexity of the paired matching problem

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