Strategies Comparison in Link Building Problem

Choosing an effective yet efficient solution to the link building problem means to select which nodes in a network should point a newcomer in order to increase its rank while limiting the cost of this operation (usually related to the number of such in-links). In this paper we consider different heuristics to address the question and we apply them both to Scale-Free (SF) and Erdős-Rényi (ER) networks, showing that the best tradeoff is achieved with the long-distance link approach, i.e. a newcomer node gathering farthest in-links succeeds in improving its position (rank) in the network with a limited cost.