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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 85; číslo 3; s. 805 - 830
Hlavní autoři:	Marino, Andrea, Silva, Ana
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2023 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!