How to Reduce Temporal Cliques to Find Sparse Spanners
<|reference_start|>How to Reduce Temporal Cliques to Find Sparse Spanners: Many real-world networks, such as transportation or trade networks, are dynamic in the sense that the edge set may change over time, but these changes are known in advance. This behavior is captured by the temporal graphs model, which has recently become a trending topic in theoretical computer science. A core open problem in the field is to prove the existence of linear-size temporal spanners in temporal cliques, i.e., sparse subgraphs of complete temporal graphs that ensure all-pairs reachability via temporal paths. So far, the best known result is the existence of temporal spanners with $\mathcal{O}(n\log n)$ many edges. We present significant progress towards proving that linear-size temporal spanners exist in all temporal cliques.   We adapt techniques used in previous works and heavily expand and generalize them to provide a simpler and more intuitive proof of the $\mathcal{O}(n\log n)$ bound. Moreover, we use our novel approach to show that a large class of temporal cliques, called edge-pivot graphs, admit linear-size temporal spanners. To contrast this, we investigate other classes of temporal cliques that do not belong to the class of edge-pivot graphs. We introduce two such graph classes and we develop novel techniques for establishing the existence of linear temporal spanners in these graph classes as well.<|reference_end|>
@article{angrick2024how,
    title={How to Reduce Temporal Cliques to Find Sparse Spanners},
    author={Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko
  Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin
  Wells},
    journal={arXiv preprint arXiv:2402.13624},
    year={2024},
    doi={10.4230/LIPIcs.ESA.2024.11},
    archivePrefix={arXiv},
    eprint={2402.13624},
    primaryClass={cs.DM cs.DS}
}