Computing Top-k Closeness Centrality Faster in Unweighted Graphs

DOI10.1137/1.9781611974317.6zbMath1429.68173arXiv1704.01077OpenAlexW2295695614MaRDI QIDQ5232547

Pierluigi Crescenzi, Michele Borassi, Henning Meyerhenke, Andrea Marino, Elisabetta Bergamini

Publication date: 12 September 2019

Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.01077

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Improving the Betweenness Centrality of a Node by Adding Links ⋮ Scalable Katz Ranking Computation in Large Static and Dynamic Graphs ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

This page was built for publication: Computing Top-k Closeness Centrality Faster in Unweighted Graphs