Algorithm 3: Constructing RNG

Input: Full list of the neighbors, $L$

Output: $\text{RNs}-L$ of the node

1) for each $v_iϵL$

2)  for each $v_jϵL$

3)   if $v_i==v_j$

4)    continue

5)   else if $d\left(v_i,v_j\right)>\text{max}\left[d\left(v_i,v_k\right),d\left(v_j,v_k\right)\right]$

6)    eliminate edge $\left(v_i,v_j\right)$

7)    break

8)   end if

9)  end for

10) end for