Temporal cliques admit sparse spanners
type: Item
instance of: scholarly article
title: Temporal cliques admit sparse spanners
author: Arnaud Casteigts
author: Joseph G. Peters
author: Jason Schoeters
published in: Journal of Computer and System Sciences
publication date: 2021-07-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.00104
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10710/
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7368158
zbMATH Keywords: temporal graphs
zbMATH Keywords: dynamic networks
zbMATH Keywords: graph spanners
zbMATH Keywords: temporal connectivity
zbMATH Keywords: reachability
zbMATH Keywords: pivotability
zbMATH Keywords: dismountability
describes a project that uses: cliques
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3157160562
cites work: Q3948568
cites work: The complexity of optimal design of temporally connected graphs
cites work: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
cites work: On the Size and the Approximability of Minimum Temporally Connected Subgraphs
cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
cites work: Temporal Cliques Admit Sparse Spanners
cites work: Distributed exploration of dynamic rings
cites work: A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
cites work: On temporal graph exploration
cites work: Q3579450
cites work: Temporal Network Theory
cites work: Connectivity and inference problems for temporal networks
cites work: Computing maximum matchings in temporal graphs.
cites work: Geometric Spanner Networks
cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
cites work: Graph spanners
cites work: Computing maximal cliques in link streams
cites work: Q4083463
cites work: Temporal graph classes: a view through temporal separators
DOI: 10.1016/J.JCSS.2021.04.004
description: scientific article; zbMATH DE number 7368158