An algorithm with a delay of $\mathcal{O}(k\hat{I}”)$ for enumerating connected induced subgraphs of size $k$

Chenglong Xiao, Chengyong Mao, Shanshan Wang

The problem of enumerating connected subgraphs of a given size in a graph has been extensively studied in recent years. In this paper, we propose an algorithm with a delay of $O(kÎ…