Fig. 4
From: A linear delay algorithm for enumerating all connected induced subgraphs
Enumerating cohesive subgraphs on a sample graph. a An example node attributed graph. b A portion of the traverse tree for attributed graph in Fig. 4 with Smin=2. Crossed search nodes indicate pruned children