$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
Fields of Study & Subjects
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 28 January 2026
- Document type
- Preprint