Comparative evaluation of centrality criterion in a hierarchical network

Authors

  • Dmytro Lande Institute of problems of information registration of National academy of science of Ukraine, Kyiv,, Ukraine
  • Olga Sulema National technical university of Ukraine «Kyiv polytechnic institute», Kyiv,, Ukraine

DOI:

https://doi.org/10.20535/2411-1031.2015.3.2.60878

Abstract

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.

Author Biographies

Dmytro Lande, Institute of problems of information registration of National academy of science of Ukraine, Kyiv,

doctor of technical science,
senior researcher, head of
the specialized modeling
tools department

Olga Sulema, National technical university of Ukraine «Kyiv polytechnic institute», Kyiv,

master program student

References

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.

Downloads

Published

2015-12-31

How to Cite

Lande, D., & Sulema, O. (2015). Comparative evaluation of centrality criterion in a hierarchical network. Collection "Information Technology and Security", 3(2), 80–87. https://doi.org/10.20535/2411-1031.2015.3.2.60878

Issue

Vol. 3 No. 2 (2015)

Section

INFORMATION TECHNOLOGY

License

Copyright (c) 2020 Collection "Information technology and security"

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The authors that are published in this collection, agree to the following terms:

  1. The authors reserve the right to authorship of their work and pass the collection right of first publication this work is licensed under the Creative Commons Attribution License, which allows others to freely distribute the published work with the obligatory reference to the authors of the original work and the first publication of the work in this collection.
     
  2. The authors have the right to conclude an agreement on exclusive distribution of the work in the form in which it was published this anthology (for example, to place the work in a digital repository institution or to publish in the structure of the monograph), provided that references to the first publication of the work in this collection.
     
  3. Policy of the journal allows and encourages the placement of authors on the Internet (for example, in storage facilities or on personal web sites) the manuscript of the work, prior to the submission of the manuscript to the editor, and during its editorial processing, as it contributes to productive scientific discussion and positive effect on the efficiency and dynamics of citations of published work (see The Effect of Open Access).