Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

  title={Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality},
  author={Maciej Rymar and Hendrik Molter and Andr{\'e} Nichterlein and Rolf Niedermeier},
In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in temporal graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static case, there are numerous natural notions… 
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
This work gives polynomial-time algorithms for the two extreme cases: delays known before departure and delays occurring without prior warning (the latter leading to a two-player game scenario).
ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks
This work presents, the first sampling-based approximation algorithm for estimating the temporal betweenness centrality values of the nodes in a temporal network, providing rigorous probabilistic guarantees on the quality of its output.
Counting Temporal Paths
This work initiates a systematic study of the prameterised and approximation complexity of #Temporal Path, the problem of counting all temporal paths between a fixed pair of vertices; like the problems of counting foremost and fastest temporal paths, it is #P-hard in general.


Algorithmic Aspects of Temporal Betweenness
This work provides a systematic study of temporal betweenness variants based on various concepts of optimal temporal paths both on a theoretical and empirical level.
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
This work proves an adaptive running time bound O(kn), where k < m is the size of a minimum feedback edge set of the input graph, and provides a strengthened worst-case running time analysis for betweenness centrality algorithms.
Approximating Betweenness Centrality
This paper presents a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs, based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality.
Temporal betweenness centrality in dynamic graphs
The bi-objective notion of shortest–fastest path (SFP) in temporal graphs is proposed, which considers both space and time as a linear combination governed by a parameter, and a novel temporal betweenness centrality (TBC) metric is defined that outperforms static BC in the task of identifying the best vertices for propagating information.
Graph Manipulations for Fast Centrality Computation
This work proposes the framework BADIOS that manipulates the graph by compressing it and splitting into pieces so that the centrality computation can be handled independently for each piece.
Efficient computation of optimal temporal walks under waiting-time constraints
An algorithm for computing shortest walks that is capable to deal with various optimization criteria and any linear combination of these and it allows to search for walks that pass multiple subsequent time-arcs in one time step, and it can deal with a richer set of optimization criteria.
Scalable computational techniques for centrality metrics on temporally detailed social network
A novel computational paradigm called epoch-point based techniques for addressing the non-stationarity challenge of TD social networks is proposed and a novel algorithm for computing shortest path based centrality metric such as betweenness on a TD social network is developed.
Better Approximation of Betweenness Centrality
A framework for unbiased approximation of betweenness is proposed that generalizes a previous approach by Brandes and yields significantly better approximation than before for many real world inputs and good approximations for the betweenness of unimportant nodes.
A faster algorithm for betweenness centrality
New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Fast approximation of betweenness centrality through sampling
Two efficient randomized algorithms for betweenness estimation are presented based on random sampling of shortest paths and offer probabilistic guarantees on the quality of the approximation.