scientific article; zbMATH DE number 7378353
From MaRDI portal
Publication:5005137
DOI10.4230/LIPIcs.MFCS.2018.36MaRDI QIDQ5005137
Erlebach, Thomas, Jakob T. Spooner
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ Optimizing reachability sets in temporal graphs by delaying ⋮ Non-strict Temporal Exploration ⋮ Shortest Journeys in Directed Temporal Graphs ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Eulerian walks in temporal graphs ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ The complexity of finding small separators in temporal graphs ⋮ Unnamed Item ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs
Cites Work
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Online and offline algorithms for the time-dependent TSP with time zones
- On temporal graph exploration
- Temporal Network Optimization Subject to Connectivity Constraints
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Connectivity and inference problems for temporal networks
- Temporal graph classes: a view through temporal separators
This page was built for publication:
