Königsberg sightseeing: Eulerian walks in temporal graphs
From MaRDI portal
Publication:2115887
DOI10.1007/978-3-030-79987-8_34OpenAlexW3182275057MaRDI QIDQ2115887FDOQ2115887
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.07522
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)
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)