
Random algorithm updates the network by randomly selecting the type of edge update (edge addition/deletion), along with the end nodes.

Nagaraja algorithm [1]} updates the network by adding edges between nodes selected on the basis of vertex-centrality measures.

DICE [2]} updates the network by randomly adding inter-community edges or deleting intra-community edges.

SADDEN [3]} updates the network by maximizing the safeness gain in every iteration of edge update based on greedy optimization.

