Abstract:An 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. What if Euler had to take a bus? In a temporal graph (G, λ), with λ : E(G) → 2 [τ ] , an edge e ∈ E(G) is available only at the times specified by λ(e) ⊆ [τ ], in the same way the connections of the public transportation network of a city or of sightseeing tours are… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.