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

Markus Bläser, Radu Curticapean (2012)

Details and statistics

DOI: 10.1007/978-3-642-33293-7_17

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics