DocumentCode :
2683265
Title :
Centrality Indices Computation in Dynamic Networks
Author :
Tabirca, Tatiana ; Tabirca, Sabin ; Yang, Laurence T.
Author_Institution :
Dept. of Comput. Sci., Univ. Coll. Cork, Cork, Ireland
fYear :
2012
fDate :
27-29 Oct. 2012
Firstpage :
202
Lastpage :
208
Abstract :
The article introduces the notion of dynamic indices as centrality measures to analyse how the importance of nodes changes in future time in dynamic networks. In particular, the dynamic closeness, dynamic graph, dynamic stress and dynamic between ness measures are investigated. We develop some algorithms for computing these indices in the dynamic case when the costs are supposed to be integers. Finally, we present some experimental results exploring the algorithms´ efficiency and illustrating the variation of the dynamic between ness index for some sample dynamic networks.
Keywords :
network theory (graphs); centrality indices computation; dynamic betweenness measures; dynamic closeness; dynamic graph; dynamic indices; dynamic networks; dynamic stress; Algorithm design and analysis; Complexity theory; Equations; Heuristic algorithms; Mathematical model; Roads; Stress; centrality indices; dynamic networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology (CIT), 2012 IEEE 12th International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4673-4873-7
Type :
conf
DOI :
10.1109/CIT.2012.60
Filename :
6391899
Link To Document :
بازگشت