Exploration of k-edge-deficient temporal graphs

DOI10.1007/978-3-030-83508-8_27MaRDI QIDQ5896891zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph algorithmsgraph explorationtemporal graphs

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• Exploration of \(k\)-edge-deficient temporal graphs
• Two moves per time step make a difference
• Faster exploration of degree-bounded temporal graphs

Cites work

• scientific article; zbMATH DE number 727573 (Why is no real title available?)
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• An introduction to temporal graphs: an algorithmic perspective
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Covering Graphs by Cycles
• Exploration of constantly connected dynamic graphs based on cactuses
• Exploration of dynamic tori by multiple agents
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• Faster exploration of degree-bounded temporal graphs
• Non-strict Temporal Exploration
• 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
• The temporal explorer who returns to the base
• Tight bounds on distributed exploration of temporal graphs
• Traveling salesman problems in temporal graphs
• Two moves per time step make a difference

Cited in

(1)

• Exploration of \(k\)-edge-deficient temporal graphs

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)