DeepAI AI Chat
Log In Sign Up

Edge exploration of temporal graphs

03/09/2021
by   Benjamin Merlin Bumpus, et al.
0

We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the static case, it is NP-hard to determine whether a given temporal graph is temporally Eulerian even if strong restrictions are placed on the structure of the underlying graph and each edge is active at only three times. However, we do obtain an FPT-algorithm with respect to a new parameter called interval-membership-width which restricts the times assigned to different edges; we believe that this parameter will be of independent interest for other temporal graph problems. Our techniques also allow us to resolve two open question of Akrida, Mertzios and Spirakis [CIAC 2019] concerning a related problem of exploring temporal stars.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/30/2020

Feedback Edge Sets in Temporal Graphs

The classical, linear-time solvable Feedback Edge Set problem is concern...
02/16/2018

Changing times to optimise reachability in temporal graphs

Temporal graphs (in which edges are active only at specified time steps)...
07/31/2018

On Exploring Temporal Graphs of Small Pathwidth

We show that the Temporal Graph Exploration Problem is NP-complete, even...
02/25/2022

Making Life More Confusing for Firefighters

It is well known that fighting a fire is a hard task. The Firefighter pr...
02/12/2021

The Complexity of Transitively Orienting Temporal Graphs

In a temporal network with discrete time-labels on its edges, entities a...
11/12/2018

Sliding Window Temporal Graph Coloring

Graph coloring is one of the most famous computational problems with app...
02/28/2020

Edge-Disjoint Branchings in Temporal Graphs

A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...