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

DOI10.1007/978-3-030-83508-8_27OpenAlexW3192232263MaRDI QIDQ5896891

Erlebach, Thomas, 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

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• The temporal explorer who returns to the base

This page was built for publication: Exploration of \(k\)-edge-deficient temporal graphs