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.
Titolo: | Strategies Comparison in Link Building Problem | |
Autori interni: | ||
Data di pubblicazione: | 2020 | |
Serie: | ||
Handle: | http://hdl.handle.net/20.500.11769/379360 | |
ISBN: | 978-3-030-32257-1 978-3-030-32258-8 | |
Appare nelle tipologie: | 2.1 Contributo in volume (Capitolo o Saggio) |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.