Sharp thresholds in random simple temporal graphs

DOI10.1109/FOCS52979.2021.00040MaRDI QIDQ6943512zbMATH OpenFDO

Authors Arnaud Casteigts, Victor Zamaraev, Michael Raskin, Malte Renken

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00040

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(7)

• Rumors with changing credibility
• Sparse temporal spanners with low stretch
• Increasing paths in random temporal graphs
• Giant components in random temporal graphs
• Distance to transitivity: new parameters for taming reachability in temporal graphs
• How to reduce temporal cliques to find sparse spanners
• Simple, strict, proper, and directed: comparing reachability in directed and undirected temporal graphs

This page was built for publication: Sharp thresholds in random simple temporal graphs

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