Temporal connectivity augmentation

DOI10.1016/J.TCS.2026.116078MaRDI QIDQ7294933zbMATH OpenFDO

Authors Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier

Publication date 13 July 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116078

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An introduction to temporal graphs: an algorithmic perspective
• Approximation Algorithms for Directed Steiner Problems
• Blackout-tolerant temporal spanners
• Connectivity and inference problems for temporal networks
• Deleting edges to restrict the size of an epidemic in temporal networks
• Distributed computation in dynamic networks
• How to reduce temporal cliques to find sparse spanners
• On the hardness of approximating minimization problems
• On the ratio of optimal integral and fractional covers
• On the size and the approximability of minimum temporally connected subgraphs
• Sharp Thresholds in Random Simple Temporal Graphs
• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Structural parameters for dense temporal graphs
• Temporal cliques admit sparse spanners
• The complexity of optimal design of temporally connected graphs
• The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

This page was built for publication: Temporal connectivity augmentation

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