Blackout-tolerant temporal spanners

DOI10.1016/j.jcss.2023.103495OpenAlexW4389295062MaRDI QIDQ6141041

Gianlorenzo D'Angelo, Mirko Rossi, Luciano Gualà, Davide Bilò, Stefano Leucci

Publication date: 22 January 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2023.103495

zbMATH Keywords

fault-tolerancetemporal graphstemporal spanners

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Temporal network optimization subject to connectivity constraints
• Fault-tolerant approximate shortest-path trees
• Graph spanners: a tutorial review
• Temporal cliques admit sparse spanners
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Fault tolerant approximate BFS structures with additive stretch
• Fault-Tolerant Approximate BFS Structures
• On the Size and the Approximability of Minimum Temporally Connected Subgraphs
• Multiple Source Dual Fault Tolerant BFS Trees
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks

This page was built for publication: Blackout-tolerant temporal spanners