Realizing temporal graphs from fastest travel times

02/17/2023
by   Nina Klobas, et al.
0

In this paper we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on periodic temporal graphs. Given an n × n matrix D and a Δ∈ℕ, the goal is to construct a Δ-periodic temporal graph with n vertices such that the duration of a fastest path from v_i to v_j is equal to D_i,j, or to decide that such a temporal graph does not exist. The variations of the problem on static graphs has been well studied and understood since the 1960's, and this area of research remains active until nowadays. As it turns out, the periodic temporal graph realization problem has a very different computational complexity behavior than its static (i.e. non-temporal) counterpart. First we show that the problem is NP-hard in general, but polynomial-time solvable if the so-called underlying graph is a tree or a cycle. Building upon those results, we investigate its parameterized computational complexity with respect to structural parameters of the underlying static graph which measure the “tree-likeness”. For those parameters, we essentially give a tight classification between parameters that allow for tractability (in the FPT sense) and parameters that presumably do not. We show that our problem is W[1]-hard when parameterized by the feedback vertex number of the underlying graph, while we show that it is in FPT when parameterized by the feedback edge number of the underlying graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
11/17/2021

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring

We consider the algorithmic complexity of recognizing bipartite temporal...
research
02/08/2021

Placing Green Bridges Optimally, with a Multivariate Analysis

We study the problem of placing wildlife crossings, such as green bridge...
research
03/14/2022

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs

We study the computational complexity of determining structural properti...
research
04/17/2021

A Timecop's Chase Around the Table

We consider the cops and robber game variant consisting of one cop and o...
research
02/11/2022

The complexity of computing optimum labelings for temporal connectivity

A graph is temporally connected if there exists a strict temporal path, ...
research
11/28/2020

On Parameterized Complexity of Liquid Democracy

In liquid democracy, each voter either votes herself or delegates her vo...

Please sign up or login with your details

Forgot password? Click here to reset