作者
Pierre Buesser, Fabio Daolio, Marco Tomassini
发表日期
2011
研讨会论文
Adaptive and Natural Computing Algorithms: 10th International Conference, ICANNGA 2011, Ljubljana, Slovenia, April 14-16, 2011, Proceedings, Part II 10
页码范围
167-176
出版商
Springer Berlin Heidelberg
简介
We study the robustness of Barabási-Albert scale-free networks with respect to intentional attacks to highly connected nodes. Using the simulated annealing optimization heuristic, we rewire the networks such that their robustness to network fragmentation is improved but without changing neither the degree distribution nor the connectivity of single nodes. We show that simulated annealing improves on the results previously obtained with a simple hill-climbing procedure. We also introduce a local move operator in order to facilitate actual rewiring and show numerically that the results are almost equally good.
引用总数
20112012201320142015201620172018201920202021202220232024134574671713168
学术搜索中的文章
P Buesser, F Daolio, M Tomassini - Adaptive and Natural Computing Algorithms: 10th …, 2011