Königsberg sightseeing: Eulerian walks in temporal graphs

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

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)

Cites Work

• Enumerating maximal cliques in link streams with durations
• Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
• The Planar Hamiltonian Circuit Problem is NP-Complete
• The Complexity of Multiterminal Cuts
• Traveling salesman problems in temporal graphs
• Connectivity and inference problems for temporal networks
• Title not available (Why is that?)
• Parameterized complexity of Eulerian deletion problems
• On temporal graph exploration
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Time-constrained Chinese postman problems
• Title not available (Why is that?)
• Decomposition of graphs into paths and cycles
• Long Circuits and Large Euler Subgraphs
• Title not available (Why is that?)
• The temporal explorer who returns to the base
• A time-dependent hierarchical Chinese postman problem
• Non-strict Temporal Exploration

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115887)