Comparative evaluation of centrality criterion in a hierarchical network
The research of centrality in hierarchical networks is presented in the paper. The characteristics of graph centrality are analyzed and discussed. The basic centrality criteria are defined. The multi-objective assessment of graph nodes is proposed. The appropriate mathematical support and software have been developed within the framework of conducted research. The experimental research of the formulated criteria efficiency has been carried out as well.
Keywords: centrality, hierarchical networks, characteristics of centrality, centrality criteria, multi-objective assessment.
Full Text:PDF (Українська)
Haivoronskyi, M. V., Novikov, O. M. (2009), Bezpeka informatsiino-komunikatsiinykh system [Safety information and communication systems], BHV Publ., Kyiv, 608 p.
Bellman, R. (1958), On a Routing Problem, Quarterly of Applied Mathematics, Vol. 16, No. 1., pp. 87-90.
Levitin, A. V. (2006), Algoritmy : vvedenie v razrabotku i analiz [Introduction to the design & analysis of algorithms], Viliams Publ., Moskow, pp. 345-353.
Kharari, F. (2003), Teoriia grafov [Graph theory], Editorial URSS Publ., Moskow, pp. 51-53.
Ziabirov, E. V., Tokarev, S. P., Fedoseeva, L. I. (2011), Metody opredeleniia kratchaishego puti mezhdu vershinami grafa [Methods for determining the shortest path between the vertices of the graph], Uspekhi sovremennogo estestvoznaniia, No. 7, pp. 113-114.
Luke, S. (2009), Essentials of Metaheuristics. A Set of Undergraduate Lecture Notes. Zeroth, Edition. Online Version 0.5, pp. 1-4.
ISSN 2411-1031 (Print), ISSN 2518-1033 (Online)