Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
An Application of Multicriteria Weighted Graph Similarity Method to Social Networks Analyzing
ASONAM '09 Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining
Hi-index | 0.00 |
In this paper we present a graph-based optimization method for information diffusion and attack durability in networks using properties of Complex Networks. We show why and how Complex Networks with Scale Free and Small World features can help optimize the topology of networks or indicate weak or strong elements of the network. We define some efficiency measures of information diffusion and attack durability in networks. Using these measures we formulate multicriteria optimization problem to choose the best network. We show a practical example of using the method based on an analysis of a few social networks.