P137: Enumeration of all maximal subset

P137: Enumeration of all maximal subset

Input:

A binary matroid $M$ on ground set $S$ and $B = \{b_1, b_2\} \subseteq S$.

Output:

All maximal subsets $X$ of $A := S \setminus B$ that span neither $b_1$ nor $b_2$.

Complexity:

Incremental polynomial time.

Comment:

Reference:

[Khachiyan2008a] (Bibtex)