Group Centrality Maximization for Large-scale Graphs

DOI10.1137/1.9781611976007.5OpenAlexW3003741852MaRDI QIDQ5147496

Daniel Zügner, Henning Meyerhenke, Alexander van der Grinten, Eugenio Angriman, Stephan Günnemann, Aleksandar Bojchevski

Publication date: 27 January 2021

Published in: 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Central Positions in Social Networks ⋮ Scalable Katz Ranking Computation in Large Static and Dynamic Graphs ⋮ Finding groups with maximum betweenness centrality via integer programming with random path sampling

This page was built for publication: Group Centrality Maximization for Large-scale Graphs