Figure 1From: A scalable method for discovering significant subnetworksA toy example. (a) a graph G = (V, E) of six nodes and nine edges. Here, V denotes the set of nodes, {A, B, C, D, E, F} and E denotes the set of edges, {(A, B), (A, D), (B, C), (B, E), (D, E), (E, A), (E, C), (E, F), (F, C)} (b) a subgraph of three nodes.Back to article page