Fig. 5
From: A linear delay algorithm for enumerating all connected induced subgraphs
Running time on random graphs. a Varying graph size; graph density set to 0.6. b Varying graph density; graph size set to 27
Fig. 5 | BMC Bioinformatics