{"title":"网格网络的中间-中心性","authors":"I. Rajasingh, Bharati Rajan, F. D.","doi":"10.1109/ICCTD.2009.230","DOIUrl":null,"url":null,"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.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Betweeness-Centrality of Grid Networks\",\"authors\":\"I. Rajasingh, Bharati Rajan, F. D.\",\"doi\":\"10.1109/ICCTD.2009.230\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":269403,\"journal\":{\"name\":\"2009 International Conference on Computer Technology and Development\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Technology and Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTD.2009.230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
