Counting Temporal Paths

02/24/2022
by   Jessica Enright, et al.
0

The betweenness centrality of a vertex v is an important centrality measure that quantifies how many optimal paths between pairs of other vertices visit v. Computing betweenness centrality in a temporal graph, in which the edge set may change over discrete timesteps, requires us to count temporal paths that are optimal with respect to some criterion. For several natural notions of optimality, including foremost or fastest temporal paths, this counting problem reduces to #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, #Temporal Path is #P-hard in general. Motivated by the many applications of this intractable problem, we initiate a systematic study of the prameterised and approximation complexity of #Temporal Path. We show that the problem presumably does not admit an FPT-algorithm for the feedback vertex number of the static underlying graph, and that it is hard to approximate in general. On the positive side, we proved several exact and approximate FPT-algorithms for special cases.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 17

page 19

page 31

page 37

research
06/15/2020

Algorithmic Aspects of Temporal Betweenness

The betweenness centrality of a graph vertex measures how often this ver...
research
09/13/2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints

Computing a (shortest) path between two vertices in a graph is one of th...
research
04/14/2023

Finding A Path Of Length k: An Expository

Given a graph G(V, E) and a positive integer k (k ≥ 1), a simple path on...
research
10/04/2021

An impossible utopia in distance geometry

The Distance Geometry Problem asks for a realization of a given weighted...
research
12/10/2020

Path Optimization Sheaves

Motivated by efforts to incorporate sheaves into networking, we seek to ...
research
02/14/2018

Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability

The exact path length problem is to determine if there is a path of a gi...
research
03/10/2021

Effectively Counting s-t Simple Paths in Directed Graphs

An important tool in analyzing complex social and information networks i...

Please sign up or login with your details

Forgot password? Click here to reset