Betweeness-Centrality of Grid Networks
Indra Rajasingh, Bharati Rajan, Florence Isido D.
Abstract
Indra Rajasingh, Bharati Rajan, Florence Isido D.
Abstract
Importance of estimating the centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications such as social network analysis or route planning. In this paper we find a formula to obtain the betweeness-centrality for grids.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Importance of estimating the centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications such as social network analysis or route planning. In this paper we find a formula to obtain the betweeness-centrality for grids.
Key concepts: Betweenness centrality, Centrality, Computer science, Node (physics), Grid, Katz centrality, Network theory, Theoretical computer science