Social Influence Maximization in Hypergraphs

. 2021 Jun 23;23(7):796. doi: 10.3390/e23070796

Algorithm 2

O p t i m i z a t i o n S t r a t e g y (H = (V, E), t_{V}, t_{E}, S)

1:
Let $S_{π} = [s_{1}, s_{2}, \dots, s_{t}]$ be a vector with all nodes in S in non-increasing order of their degree.
2:
for $i \in [1, t]$ do
3:
$I_{V} [S_{π}], I_{E} [S_{π}] = Φ (H, S_{π} - {s_{i}}, t_{V}, t_{E})$
4:
if $I_{V} [S_{π}] = V$ then
5:
$S_{π} = S_{π} - {s_{i}}$ ;
6:
return $S_{π}$