P507: Enumerate all maximal connected induced $k$-degenerate subgraphs in a graph

P507: Enumerate all maximal connected induced $k$-degenerate subgraphs in a graph

Input:

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

Output:

All maximal connected induced $k$-degenerate subgraphs in $G$.

Complexity:

$O(mn^{k+3})$ delay.

Comment:

Exponential space. Proximity search.

Reference:

[Conte2019] (Bibtex)