Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks
Betweenness centrality (BC), a classic measure which quantifies the importance of a vertex
to act as a communication" bridge" between other vertices in the network, is widely used in …
to act as a communication" bridge" between other vertices in the network, is widely used in …
Making temporal betweenness computation faster and restless
F Brunelli, P Crescenzi, L Viennot - Proceedings of the 30th ACM …, 2024 - dl.acm.org
Buss et al [KDD 2020] recently proved that the problem of computing the betweenness of all
nodes of a temporal graph is computationally hard in the case of foremost and fastest paths …
nodes of a temporal graph is computationally hard in the case of foremost and fastest paths …
Mantra: Temporal betweenness centrality approximation through sampling
A Cruciani - Joint European Conference on Machine Learning and …, 2024 - Springer
We present MANTRA, a framework for approximating the temporal betweenness centrality of
all nodes in a temporal graph. Our method can compute probabilistically guaranteed high …
all nodes in a temporal graph. Our method can compute probabilistically guaranteed high …