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

Algorithm 1

Greedy algorithm.

(1) 𝐴=Φ

(2) for 𝑖=1 to 𝑘 do

(3) 𝑣_𝑖=argmax_{𝑢∈𝑉⧵𝐴}(𝜎(𝐴∪{𝑢})−𝜎(𝐴))

(4) 𝐴=𝐴∪{𝑣_𝑖}

(5) end for