Computing parameters of sequence-based dynamic graphs
type: Item
instance of: scholarly article
title: Computing parameters of sequence-based dynamic graphs
zbMATH Open document ID: 1414.05271
author: Arnaud Casteigts
author: Ralf Klasing
author: Yessin M. Neggaz
author: Joseph G. Peters
published in: Theory of Computing Systems
publication date: 2019-06-27T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 7074488
zbMATH Keywords: dynamic networks
zbMATH Keywords: property testing
zbMATH Keywords: generic algorithms
zbMATH Keywords: temporal connectivity
describes a project that uses: cliques
MaRDI profile type: Publication
full work available at URL: s00224-018-9876-z
OpenAlex ID: W2885021324
cites work: DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
cites work: Self-stabilizing robots in highly dynamic environments
cites work: The complexity of data aggregation in static and dynamic wireless sensor networks
cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
cites work: Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
cites work: Measuring Temporal Lags in Delay-Tolerant Networks
cites work: Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
cites work: Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs
cites work: A generic framework for computing parameters of sequence-based dynamic graphs
cites work: Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems
cites work: On the exploration of time-varying networks
cites work: Q3992991
cites work: Q4023519
cites work: Distributed computation in dynamic networks
cites work: On the treewidth of dynamic graphs
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Computing maximal cliques in link streams
Wikidata QID: Q129499877
DOI: 10.1007/S00224-018-9876-Z
description: scientific article; zbMATH DE number 7074488