Table 1.

Time complexity comparison

dGHD	Closed-form
O(N 2|E|)	O(N|E|+N log(N)+K 2|E|)

Here K represents the number of nodes for which p-value is greater than θ and generally K≪N. An important remark is that the cGHD calculation after removal of each node can be done independently in parallel. So, in case we have T processors, the complexity of the proposed approach will reduce ≈ linearly w.r.t. T