An Algorithm with a Delay of O(kΔ) for Enumerating All Connected Induced Subgraphs of Size k

The proposed algorithm enumerates all connected induced subgraphs of size k in a graph with a delay of O(kΔ), where k is the subgraph size and Δ is the maximum degree of the graph.