Eulerian walks in temporal graphs

DOI10.1007/S00453-022-01021-YzbMath1506.68083OpenAlexW4293017958MaRDI QIDQ2689257

Yanyan Li

Publication date: 9 March 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01021-y

zbMATH Keywords

Eulerian trailsedge coverparameterized complexitybounded treewidthtemporal graphsEulerian walks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Mengerian graphs: characterization and recognition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traveling salesman problems in temporal graphs
• Treewidth. Computations and approximations
• Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
• Time-constrained Chinese postman problems
• Königsberg sightseeing: Eulerian walks in temporal graphs
• Decomposition of graphs into paths and cycles
• A time-dependent hierarchical Chinese postman problem
• Parameterized complexity of Eulerian deletion problems
• On temporal graph exploration
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Postman tour on a graph with precedence relation on arcs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• The Complexity of Multiterminal Cuts
• Non-strict Temporal Exploration
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Long Circuits and Large Euler Subgraphs
• Connectivity and inference problems for temporal networks
• Edge exploration of temporal graphs
• The temporal explorer who returns to the base

This page was built for publication: Eulerian walks in temporal graphs