Towards classifying the polynomial-time solvability of temporal betweenness centrality
From MaRDI portal
Publication:2672438
DOI10.1007/978-3-030-86838-3_17OpenAlexW3204791090MaRDI QIDQ2672438
Maciej Rymar, André Nichterlein, Hendrik Molter, Rolf Niedermeier
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2105.13055
network sciencecounting complexitytemporal graphsnetwork centrality measurestemporal paths and walks
Related Items (4)
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ Computing Betweenness Centrality in Link Streams ⋮ On finding separators in temporal split and permutation graphs ⋮ Foremost non-stop journey arrival in linear time
Uses Software
Cites Work
- Unnamed Item
- Betweenness in time dependent networks
- Scalable computational techniques for centrality metrics on temporally detailed social network
- Fast approximation of betweenness centrality through sampling
- Finding temporal paths under waiting time constraints
- The complexity of finding small separators in temporal graphs
- A faster algorithm for betweenness centrality*
- On a routing problem
- Topology manipulations for speeding betweenness centrality computation
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- Better Approximation of Betweenness Centrality
- Approximating Betweenness Centrality
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
This page was built for publication: Towards classifying the polynomial-time solvability of temporal betweenness centrality
