Exploration of k-edge-deficient temporal graphs
From MaRDI portal
Publication:5896891
DOI10.1007/978-3-030-83508-8_27OpenAlexW3192232263MaRDI QIDQ5896891FDOQ5896891
Authors: Thomas Erlebach, Jakob T. Spooner
Publication date: 25 March 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_27
Cites Work
- Traveling salesman problems in temporal graphs
- An introduction to temporal graphs: an algorithmic perspective
- Title not available (Why is that?)
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Online and offline algorithms for the time-dependent TSP with time zones
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Covering Graphs by Cycles
- 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
- On exploring always-connected temporal graphs of small pathwidth
- The complexity of finding small separators in temporal graphs
- Faster exploration of degree-bounded temporal graphs
- The temporal explorer who returns to the base
- Exploration of dynamic tori by multiple agents
- Tight bounds on distributed exploration of temporal graphs
- Non-strict Temporal Exploration
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Exploration of \(k\)-edge-deficient temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896891)