P508: All maximal $k$-degenerate edge subgraphs in a graph

P508: All maximal $k$-degenerate edge subgraphs in a graph

Input:

A graph $G=(V, E)$ and an integer $k$.

Output:

All maximal $k$-degenerate edge subgraphs in $G$.

Complexity:

$O(\binom{n}{k-1}m^3)$ delay.

Comment:

Exponential space. Proximity search.

Reference:

[Conte2019] (Bibtex)