Computing parameters of sequence-based dynamic graphs
From MaRDI portal
Publication:1999994
DOI10.1007/s00224-018-9876-zzbMath1414.05271OpenAlexW2885021324WikidataQ129499877 ScholiaQ129499877MaRDI QIDQ1999994
Arnaud Casteigts, Yessin M. Neggaz, Joseph G. Peters, Ralf Klasing
Publication date: 27 June 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9876-z
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Connectivity (05C40)
Related Items (2)
Optimizing reachability sets in temporal graphs by delaying ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the treewidth of dynamic graphs
- Computing maximal cliques in link streams
- A generic framework for computing parameters of sequence-based dynamic graphs
- On the exploration of time-varying networks
- The complexity of data aggregation in static and dynamic wireless sensor networks
- Distributed computation in dynamic networks
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs
- Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
- Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems
- Measuring Temporal Lags in Delay-Tolerant Networks
- Depth-First Search and Linear Graph Algorithms
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Self-stabilizing robots in highly dynamic environments
This page was built for publication: Computing parameters of sequence-based dynamic graphs
