Temporal cliques admit sparse spanners
From MaRDI portal
Recommendations
Cites work
- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- Computing maximal cliques in link streams
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Connectivity and inference problems for temporal networks
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- Geometric Spanner Networks
- Graph spanners
- scientific article; zbMATH DE number 5764857 (Why is no real title available?)
- On the size and the approximability of minimum temporally connected subgraphs
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- The complexity of finding small separators in temporal graphs
- The complexity of optimal design of temporally connected graphs
Cited in
(10)- Temporal cliques admit sparse spanners
- Maximum 0-1 timed matching on temporal graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Finding Temporal Paths Under Waiting Time Constraints.
- Sharp Thresholds in Random Simple Temporal Graphs
- A new temporal interpretation of cluster editing
- Cluster editing for multi-layer and temporal graphs
- Parameterized restless temporal path
- The complexity of transitively orienting temporal graphs
- How to reduce temporal cliques to find sparse spanners
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 Q5092337)
