P268: Enumeration of all bounded union

P268: Enumeration of all bounded union

Input:

A graph with $h$ multiedges each with at most $d$ vertices.

Output:

All minimal subset $U$ of at most $k$ vertices that entirely includes at least one set from each multiedge.

Complexity:

$O(dc^{k+1}h + \min(kc^{2k}, hkc^k))$ time.

Comment:

Reference:

[Damaschke2006] (Bibtex)