ISSN 1944-9488
Vol. 11, Issue 4, 2015September 02, 2015 EDT
A Faster Algorithm to Update Betweenness Centrality After Node Alteration
A Faster Algorithm to Update Betweenness Centrality After Node Alteration
Articles in Vol. 11, Issue 4, 2015
Vol. 11, Issue 4, 2015
- Long Paths in Random Apollonian NetworksAlan FriezeColin Cooper
- A Local Clustering Algorithm for Connection GraphsMark KemptonFan Chung
- Sublinear Column-wise Actions of the Matrix Exponential on Social NetworksKyle KlosterDavid F. Gleich
- Random Intersection Graph ProcessMindaugas BloznelisMichał Karoński
- A Faster Algorithm to Update Betweenness Centrality After Node AlterationKeshav GoelRishi Ranjan SinghSukrit GuptaS. R. S. Iyengar
- On the Power of Planned Infections in NetworksMoez DraiefSanjeev KhannaMichael Brautbar
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community DetectionMd. Mostofa Ali PatwaryWei-keng LiaoAlok ChoudharyBharath PattabiramanAssefaw H. Gebremedhin
- Solving Local Linear Systems with Boundary Conditions Using Heat Kernel PagerankFan ChungOlivia Simpson
- Tree Nash Equilibria in the Network Creation GameMatúš MihalákDominik MüllerAkaki Mamageishvili
- Statement of RemovalInternet Mathematics
- Special Issue on Algorithms and Models for the Web-graphPaweł PrałatAnthony Bonato
Goel, Keshav, Rishi Ranjan Singh, Sukrit Gupta, and S. R. S. Iyengar. 2015. “A Faster Algorithm to Update Betweenness Centrality After Node Alteration.” Internet Mathematics 11 (4). https://doi.org/10.1080/15427951.2014.982311.