Skip to main content
Figure 2 | Computational Social Networks

Figure 2

From: Efficiently identifying critical nodes in large complex networks

Figure 2

Equivalent (a) original graph and (b) DFS tree. Back edges are indicated as dashed arrows in DFS(0). The shaded areas correspond to resulting connected components if vertex v=3 is removed from the graph. A traditional application of DFS is to detect cut vertices (i.e., articulation points), which forms the basis for our approach.

Back to article page