@inproceedings{6d7a27f6884f477db6eab1ed8d48dbe1,
title = "Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality",
abstract = "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 of being a “shortest” temporal path (walk). Depending on which notion is used, it was already observed that the problem is \#P-hard in some cases while polynomial-time solvable in others. In this conceptual work, we contribute towards classifying what a “shortest path (walk) concept” has to fulfill in order to gain polynomial-time computability of temporal betweenness centrality.",
keywords = "Counting complexity, Network centrality measures, Network science, Temporal graphs, Temporal paths and walks",
author = "Maciej Rymar and Hendrik Molter and Andr{\'e} Nichterlein and Rolf Niedermeier",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021 ; Conference date: 23-06-2021 Through 25-06-2021",
year = "2021",
month = jan,
day = "1",
doi = "10.1007/978-3-030-86838-3\_17",
language = "English",
isbn = "9783030868376",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "219--231",
editor = "Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski",
booktitle = "Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Revised Selected Papers",
address = "Germany",
}