Heuristical top-\(k\): fast estimation of centralities in complex networks

DOI10.1016/J.IPL.2014.03.006zbMath1296.68111OpenAlexW1986637826MaRDI QIDQ2448118

Nicolas Le Scouarnec, Gilles Tredan, E. Le Merrer

Publication date: 30 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.03.006

zbMATH Keywords

information retrievalnetwork analysiscomplex networkscentralities

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)

Cites Work

• Graph theoretic and spectral analysis of Enron email data
• Incremental deployment of network monitors based on Group Betweenness Centrality
• A faster algorithm for betweenness centrality*
• Ranking of Closeness Centrality for Large-Scale Social Networks
• Approximating PageRank from In-Degree
• Routing betweenness centrality
• CENTRALITY ESTIMATION IN LARGE NETWORKS

This page was built for publication: Heuristical top-\(k\): fast estimation of centralities in complex networks