Fig. 5From: A linear delay algorithm for enumerating all connected induced subgraphsRunning time on random graphs. a Varying graph size; graph density set to 0.6. b Varying graph density; graph size set to 27Back to article page