Eulerian Walks in Temporal Graphs

Abstract

AbstractAn Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph G at least (resp. exactly) once. This notion was first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. But what if Euler had to take a bus? In a temporal graph $$\varvec{(G,\lambda )}$$ ( G , λ ) , with $$\varvec{\lambda : E(G)}\varvec{\rightarrow } \varvec{2}^{\varvec{[\tau ]}}$$ λ : E ( G ) → 2 [ τ ] , an edge $$\varvec{e}\varvec{\in } \varvec{E(G)}$$ e ∈ E ( G ) is available only at the times specified by $$\varvec{\lambda (e)}\varvec{\subseteq } \varvec{[\tau ]}$$ λ ( e ) ⊆ [ τ ] , in the same way the connections of the public transportation network of a city or of sightseeing tours are available only at scheduled times. In this paper, we deal with temporal walks, local trails, and trails, respectively referring to edge traversal with no constraints, constrained to not repeating the same edge in a single timestamp, and constrained to never repeating the same edge throughout the entire traversal. We show that, if the edges are always available, then deciding whether $$\varvec{(G,\lambda )}$$ ( G , λ ) has a temporal walk or trail is polynomial, while deciding whether it has a local trail is $$\varvec{\texttt {NP}}$$ NP -complete even if $$\varvec{\tau = 2}$$ τ = 2 . In contrast, in the general case, solving any of these problems is $$\varvec{\texttt {NP}}$$ NP -complete, even under very strict hypotheses. We finally give $$\varvec{\texttt {XP}}$$ XP algorithms parametrized by $$\varvec{\tau }$$ τ for walks, and by $$\varvec{\tau +tw(G)}$$ τ + t w ( G ) for trails and local trails, where $$\varvec{tw(G)}$$ t w ( G ) refers to the treewidth of $$\varvec{G}$$ G .