Skip to content
Research Article Open access CC BY 4.0

Real-World Implementations of Network Centrality Algorithms across Various

Karam Kamal Younis, Ibrahim Mahmood Ibrahim

Asian Journal of Research in Computer Science · pp. 147–162 · Published 3 Feb 2025

10.9734/ajrcos/2025/v18i2568

Abstract

The tutorial analyses how and in what ways the algorithms are used and can be employed in different fields and in the scientific context. This paper revisits the centrality measures; degree, betweenness, closeness and eigenvector centrality and how they are used to study complex networks from social networks, to biology, economy and telecommunications. From the couple of cases and examples, the article shows how these algorithms are utilized to find these vital nodes, improve network performance as well as decision making. Pros and Cons Each of the methods and results evidence the flexibility of centrality measures in enhancing the knowledge and analysis of complex systems. However, issues of scaling these algorithms to operational networks and environments are still explicit. The need for tailor-made centrality analysis methods of scalability and adaptiveness are also outlined for future research agendas in this review.

Centrality practical uses complex network social networks optimization of algorithm

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.