Eulerian Walks in Temporal Graphs

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. But what if Euler had to take a bus? In a temporal g...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 3; S. 805 - 830
Hauptverfasser:	Marino, Andrea, Silva, Ana
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.03.2023 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Constraints Data Structures and Information Theory Mathematics of Computing Polynomials Public transportation Special Issue on Combinatorial Algorithms (IWOCA 2021) Theory of Computation Transportation networks Temporal graphs Eulerian trails Bounded treewidth Edge cover Parameterized complexity Eulerian walks
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!