Weighted Counting of k-Matchings Is #W[1]-Hard

DOI10.1007/978-3-642-33293-7_17zbMath1337.68112OpenAlexW187679534MaRDI QIDQ4899251

Radu Curticapean, Markus Bläser

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_17

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) 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)

Related Items (4)

Compactors for parameterized counting problems ⋮ The challenges of unbounded treewidth in parameterised subgraph counting problems ⋮ Unnamed Item ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications

This page was built for publication: Weighted Counting of k-Matchings Is #W[1]-Hard