Mengerian graphs: characterization and recognition

08/12/2022
by   Allen Ibiapina, et al.
0

A temporal graph G is a graph that changes with time. More specifically, it is a pair (G, λ) where G is a graph and λ is a function on the edges of G that describes when each edge e∈ E(G) is active. Given vertices s,t∈ V(G), a temporal s,t-path is a path in G that traverses edges in non-decreasing time; and if s,t are non-adjacent, then a temporal s,t-cut is a subset S⊆ V(G)∖{s,t} whose removal destroys all temporal s,t-paths. It is known that Menger's Theorem does not hold on this context, i.e., that the maximum number of internally vertex disjoint temporal s,t-paths is not necessarily equal to the minimum size of a temporal s,t-cut. In a seminal paper, Kempe, Kleinberg and Kumar (STOC'2000) defined a graph G to be Mengerian if equality holds on (G,λ) for every function λ. They then proved that, if each edge is allowed to be active only once in (G,λ), then G is Mengerian if and only if G has no gem as topological minor. In this paper, we generalize their result by allowing edges to be active more than once, giving a characterization also in terms of forbidden structures. We additionally provide a polynomial time recognition algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2022

Menger's Theorem for Temporal Paths (Not Walks)

A temporal graph is a graph whose edges are available only at specific t...
research
02/13/2023

Snapshot disjointness in temporal graphs

In the study of temporal graphs, only paths respecting the flow of time ...
research
02/15/2023

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor

In this paper, we study temporal graphs arising from mobility models whe...
research
04/13/2019

Minimal Separators in Graphs

The Known Menger's theorem states that in a finite graph, the size of a ...
research
02/28/2020

Edge-Disjoint Branchings in Temporal Graphs

A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...
research
02/20/2018

Temporal Vertex Cover with a Sliding Time Window

Modern, inherently dynamic systems are usually characterized by a networ...
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