Matroid / Spanning (Bibtex)

P130: Enumeration of all minimal spanning and connected subsets in a matroid
Input:
A matroid $M$.
Output:
All minimal spanning and connected subsets in $M$.
Complexity:
Incremental quasi-polynomial time.
Comment:
$f(x)$ is a quasi-polynomial if $f(x) \in O(2^{polylog (n)})$.
Reference:
[Khachiyan2006a] (Bibtex)