An algorithm with a delay of $\mathcalO(k\Delta)$ for enumerating connected induced subgraphs of size $k$
<|reference_start|>An algorithm with a delay of $\mathcalO(k\Delta)$ for enumerating connected induced subgraphs of size $k$: The problem of enumerating connected subgraphs of a given size in a graph has been extensively studied in recent years. In this short communication, we propose an algorithm with a delay of $\mathcal{O}(k\Delta)$ for enumerating all connected induced subgraphs of size $k$ in an undirected graph $G=(V, E)$, where $k$ and $\Delta$ are respectively the size of subgraphs and the maximum degree of $G$. The proposed algorithm improves upon the current best delay bound $\mathcal{O}(k^2\Delta)$ for the connected induced subgraph enumeration problem in the literature.<|reference_end|>
@article{xiao2024an,
    title={An algorithm with a delay of $\mathcal{O}(k\Delta)$ for enumerating
  connected induced subgraphs of size $k$},
    author={Chenglong Xiao, Chengyong Mao, Shanshan Wang},
    journal={arXiv preprint arXiv:2404.12559},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.12559},
    primaryClass={cs.DS cs.DM}
}