Blackout-tolerant temporal spanners

DOI10.1016/J.JCSS.2023.103495MaRDI QIDQ6141041zbMATH OpenOpenAlexFDO

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

Publication date 22 January 2024

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

• An introduction to temporal graphs: an algorithmic perspective
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Fault tolerant approximate BFS structures with additive stretch
• Fault-tolerant approximate BFS structures
• Fault-tolerant approximate shortest-path trees
• Graph spanners: a tutorial review
• Multiple source dual fault tolerant BFS trees
• Multiple-edge-fault-tolerant approximate shortest-path trees
• On computing the diameter of (weighted) link streams
• On the size and the approximability of minimum temporally connected subgraphs
• Preserving distances in very faulty graphs
• Temporal cliques admit sparse spanners
• Temporal network optimization subject to connectivity constraints

Cited in

(3)

• Temporal reachability dominating sets: contagion in temporal graphs
• Temporal queries for dynamic temporal forests
• Enumerating spanners in directed temporal graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6141041)