Menger's Theorem for Temporal Paths (Not Walks)

06/30/2022
by   Allen Ibiapina, et al.
0

A temporal graph is a graph whose edges are available only at specific times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability, i.e. sequence of adjacent edges whose appearing times are non-decreasing. Temporal paths are temporal walks where each vertex is not traversed twice, i.e. time instants of each vertex, called temporal vertices, are visited consecutively. While on static graphs Menger's Theorem relies on disjoint paths, in temporal graphs the literature has focused on disjoint temporal walks. In this paper we focus on Menger's Theorem for temporal paths that are disjoint in temporal vertices. Given two vertices s and t, let k be equal to the maximum number of temporal vertex disjoint s,t-paths. We prove that k is equal to the minimum number of temporal vertices to be removed to break all the s,t-paths, i.e. Menger's Theorem holds, if and only if k=1. The latter property also allows us to show that the related max-paths problem in temporal graphs is polynomial when k≤ 2. This is best possible as we prove that such problem is -hard when k≥ 3 for the directed case. Finally, we also give hardness results and an XP algorithm for the related min-cut problem.

READ FULL TEXT

page 1

page 4

page 7

page 11

page 15

page 17

page 27

research
08/12/2022

Mengerian graphs: characterization and recognition

A temporal graph G is a graph that changes with time. More specifically,...
research
02/13/2023

Snapshot disjointness in temporal graphs

In the study of temporal graphs, only paths respecting the flow of time ...
research
04/13/2019

Minimal Separators in Graphs

The Known Menger's theorem states that in a finite graph, the size of a ...
research
01/25/2023

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

A temporal graph has an edge set that may change over discrete time step...
research
09/10/2019

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow

Let G=(V,E) be a multigraph with a set T⊆ V of terminals. A path in G is...
research
12/27/2018

On the Approximability of Time Disjoint Walks

We introduce the combinatorial optimization problem Time Disjoint Walks....
research
11/22/2022

Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time

In a temporal graph, each edge is available at specific points in time. ...

Please sign up or login with your details

Forgot password? Click here to reset