An Algorithm for Critical Nodes Problem in Social Networks Based on Owen Value

Algorithm 3

TOP_𝐾(𝑉).

Top𝐾[1,…,𝑘] = 0

AsceSort(𝑉);

Top𝐾[1] = 𝑉[1]

𝑖=1

𝑗=2;

while 𝑖<𝑘 do

    if 𝑉[𝑗] is not adjacent to Top𝐾[1,…,𝑖−1] then

    Top𝐾[𝑖] = 𝑉[𝑗]

     𝑖=𝑖+1

    end

    𝑗=𝑗+1

end