Group Centrality Maximization for Large-scale Graphs

DOI10.1137/1.9781611976007.5MaRDI QIDQ5147496zbMATH OpenOpenAlexFDO

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

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)

Cited in

(8)

• Faster computation of successive bounds on the group betweenness centrality
• Central Positions in Social Networks
• Scalable Katz ranking computation in large static and dynamic graphs
• scientific article; zbMATH DE number 5663542 (Why is no real title available?)
• Finding groups with maximum betweenness centrality via integer programming with random path sampling
• On critical node problems with vulnerable vertices
• The parameterized complexity of maximum betweenness centrality
• A survey on optimization studies of group centrality metrics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147496)