Blackout-tolerant temporal spanners

DOI10.1007/978-3-031-22050-0_3MaRDI QIDQ6111995zbMATH OpenFDO

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

Publication date 4 August 2023

Published in Algorithmics of Wireless Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22050-0_3

zbMATH Keywords

fault-tolerancetemporal graphstemporal spanners

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Artificial intelligence for robotics (68T40)

Cites work

• An introduction to temporal graphs: an algorithmic perspective
• Blackout-tolerant temporal spanners
• Connectivity and inference problems for temporal networks
• Graph spanners: a tutorial review
• On computing the diameter of (weighted) link streams
• On the size and the approximability of minimum temporally connected subgraphs
• Temporal cliques admit sparse spanners
• Temporal network optimization subject to connectivity constraints

Cited in

(4)

• Blackout-tolerant temporal spanners
• How to reduce temporal cliques to find sparse spanners
• Temporal connectivity augmentation
• Reachability in temporal graphs under perturbation

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 Q6111995)