Algorithm 1. Partition of the vertex set G

Input: $\mathrm{FMIND}\left(I,x,r\right),\mathrm{FMIND}\left(J,x,r\right),G,\delta ,\epsilon$, $R_{LP}$

Output: $G_s,G_d$

(1) $G_s=\varnothing$;

(2) for (i = 1; i ≤ |$G_x$|; i = i++)

(3) for (j = 1; j ≤ |$G_y$|; j = j++)

(4) for (k = 1; k ≤ |$G_z$|; k = k++)

(5) con = 0;

(6) while $x\in LP(p_{i,j,k}$)

(7) if ($1\text{-}\mathrm{SADF}\left(I\left(x\right),J\left(x\right)\right)>\delta$)

(8) con++;

(9) end if

(10) end while

(11) if $(\frac{con}{\left|LP(p_{i,j,k})\right|}>\epsilon )$

(12) $G_s=p_{i,j,k}\cup G_s$;

(13) end if

(14) end for

(15) end for

(16) end for

(17) $G_d$ = $G-G_s$;

(18) return $G_s,G_d$;