Königsberg sightseeing: Eulerian walks in temporal graphs

DOI10.1007/978-3-030-79987-8_34OpenAlexW3182275057MaRDI QIDQ2115887

Yanyan Li

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2103.07522

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (5)

Untangling temporal graphs of bounded degree ⋮ Timeline cover in temporal graphs: exact and approximation algorithms ⋮ Eulerian walks in temporal graphs ⋮ Edge exploration of temporal graphs ⋮ Finding colorful paths in temporal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traveling salesman problems in temporal graphs
• Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
• Enumerating maximal cliques in link streams with durations
• Time-constrained Chinese postman problems
• Decomposition of graphs into paths and cycles
• A time-dependent hierarchical Chinese postman problem
• Parameterized complexity of Eulerian deletion problems
• On temporal graph exploration
• 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
• The temporal explorer who returns to the base

This page was built for publication: Königsberg sightseeing: Eulerian walks in temporal graphs