Temporal cliques admit sparse spanners
From MaRDI portal
Publication:2040022
DOI10.1016/J.JCSS.2021.04.004OpenAlexW3157160562MaRDI QIDQ2040022FDOQ2040022
Jason Schoeters, Joseph G. Peters, Arnaud Casteigts
Publication date: 6 July 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.00104
dynamic networksreachabilitygraph spannerstemporal graphstemporal connectivitypivotabilitydismountability
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric Spanner Networks
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Graph spanners
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Connectivity and inference problems for temporal networks
- Temporal Network Theory
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- On temporal graph exploration
- Computing maximum matchings in temporal graphs.
- Computing maximal cliques in link streams
- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- Temporal graph classes: a view through temporal separators
- The complexity of optimal design of temporally connected graphs
- On the Size and the Approximability of Minimum Temporally Connected Subgraphs
- Distributed exploration of dynamic rings
- Temporal Cliques Admit Sparse Spanners
Cited In (11)
- Temporal reachability minimization: delaying vs. deleting
- Blackout-tolerant temporal spanners
- A new temporal interpretation of cluster editing
- Temporally connected components
- The complexity of computing optimum labelings for temporal connectivity
- Feedback edge sets in temporal graphs
- Blackout-tolerant temporal spanners
- Simple, strict, proper, happy: a study of reachability in temporal graphs
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
- Finding temporal paths under waiting time constraints
- Sharp Thresholds in Random Simple Temporal Graphs
Uses Software
This page was built for publication: Temporal cliques admit sparse spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040022)
