Name
Abstract | ||
|---|---|---|
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 Erdos-Renyi (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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-32258-8_23 | Studies in Computational Intelligence |
Keywords | DocType | Volume |
PageRank,Best attachment,Link building,NP-hard,Long distance link | Conference | 868.0 |
ISSN | Citations | PageRank |
1860-949X | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincenza Carchiolo | 1 | 261 | 51.62 |
| M. Grassia | 2 | 0 | 2.03 |
| Alessandro Longheu | 3 | 142 | 29.98 |
| Michele Malgeri | 4 | 219 | 42.79 |
| Giuseppe Mangioni | 5 | 199 | 37.16 |