Exploration of \(k\)-edge-deficient temporal graphs
From MaRDI portal
Publication:5918789
DOI10.1007/s00236-022-00421-5OpenAlexW4293317470MaRDI QIDQ5918789
Jakob T. Spooner, Erlebach, Thomas
Publication date: 30 August 2022
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-022-00421-5
Related Items (1)
Cites Work
- Traveling salesman problems in temporal graphs
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- On exploring always-connected temporal graphs of small pathwidth
- Online and offline algorithms for the time-dependent TSP with time zones
- The complexity of finding small separators in temporal graphs
- Exploration of dynamic tori by multiple agents
- On temporal graph exploration
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- Covering Graphs by Cycles
- Finding kth paths and p-centers by generating and searching good data structures
- Non-strict Temporal Exploration
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Tight bounds on distributed exploration of temporal graphs
- Connectivity and inference problems for temporal networks
- Exploration of \(k\)-edge-deficient temporal graphs
- The temporal explorer who returns to the base
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exploration of \(k\)-edge-deficient temporal graphs
