A Faster Algorithm to Update Betweenness Centrality After Node Alteration

Q3 Mathematics Internet Mathematics Pub Date : 2013-12-14 DOI:10.1080/15427951.2014.982311
Keshav Goel, R. Singh, S. Iyengar, Sukrit Gupta
{"title":"A Faster Algorithm to Update Betweenness Centrality After Node Alteration","authors":"Keshav Goel, R. Singh, S. Iyengar, Sukrit Gupta","doi":"10.1080/15427951.2014.982311","DOIUrl":null,"url":null,"abstract":"Betweenness centrality is widely used as a centrality measure, with applications across several disciplines. It is a measure that quantifies the importance of a vertex based on the vertex’s occurrence on shortest paths in a graph. This is a global measure, and in order to find the betweenness centrality of a node, one is supposed to have complete information about the graph. Most of the algorithms that are used to find betweenness centrality assume the constancy of the graph and are not efficient for dynamic networks. We propose a technique to update betweenness centrality of a graph when nodes are added or deleted. Observed experimentally, for real graphs, our algorithm speeds up the calculation of betweenness centrality from 7 to 412 times in comparison to the currently best-known techniques.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2014.982311","citationCount":"40","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Internet Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/15427951.2014.982311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 40

Abstract

Betweenness centrality is widely used as a centrality measure, with applications across several disciplines. It is a measure that quantifies the importance of a vertex based on the vertex’s occurrence on shortest paths in a graph. This is a global measure, and in order to find the betweenness centrality of a node, one is supposed to have complete information about the graph. Most of the algorithms that are used to find betweenness centrality assume the constancy of the graph and are not efficient for dynamic networks. We propose a technique to update betweenness centrality of a graph when nodes are added or deleted. Observed experimentally, for real graphs, our algorithm speeds up the calculation of betweenness centrality from 7 to 412 times in comparison to the currently best-known techniques.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种节点改变后间性中心性更新的快速算法
中间中心性作为一种中心性度量被广泛使用,其应用跨越多个学科。它是一种基于顶点在图中最短路径上出现的次数来量化顶点重要性的度量。这是一个全局度量,为了找到一个节点的中间性中心性,一个人应该有关于图的完整信息。大多数用于寻找中间性中心性的算法都假设了图的恒定性,对于动态网络来说效率不高。提出了一种在增加或删除节点时更新图的中间性中心性的方法。通过实验观察,对于真实的图,与目前最著名的技术相比,我们的算法将中间性中心性的计算速度从7倍提高到412倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Internet Mathematics
Internet Mathematics Mathematics-Applied Mathematics
自引率
0.00%
发文量
0
期刊最新文献
Graph search via star sampling with and without replacement Preferential Placement for Community Structure Formation A Multi-type Preferential Attachment Tree Editorial Board EOV A Theory of Network Security: Principles of Natural Selection and Combinatorics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1