A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Parameterized counting of trees, forests and matroid bases
[article]
2016
arXiv
pre-print
We investigate the complexity of counting trees, forests and bases of matroids from a parameterized point of view. It turns out that the problems of computing the number of trees and forests with k edges are # W[1]-hard when parameterized by k. Together with the recent algorithm for deterministic matrix truncation by Lokshtanov et al. (ICALP 2015), the hardness result for k-forests implies # W[1]-hardness of the problem of counting bases of a matroid when parameterized by rank or nullity, even
arXiv:1611.01823v1
fatcat:mzq5iqfqsrgufczdc2seww63km