Non-strict Temporal Exploration
From MaRDI portal
Publication:5100955
DOI10.1007/978-3-030-54921-3_8OpenAlexW3044233549MaRDI QIDQ5100955
Jakob T. Spooner, Erlebach, Thomas
Publication date: 1 September 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_8
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (5)
Eulerian walks in temporal graphs ⋮ Parameterised temporal exploration problems ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Traveling salesman problems in temporal graphs
- A simplified NP-complete satisfiability problem
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- On exploring always-connected temporal graphs of small pathwidth
- Online and offline algorithms for the time-dependent TSP with time zones
- On the exploration of time-varying networks
- Finding temporal paths under waiting time constraints
- Distributed exploration of dynamic rings
- Exploration of dynamic networks: tight bounds on the number of agents
- On temporal graph exploration
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- 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
- The temporal explorer who returns to the base
This page was built for publication: Non-strict Temporal Exploration
