On Verifying and Maintaining Connectivity of Interval Temporal Networks
From MaRDI portal
Publication:5087856
DOI10.1142/S0129626419500099zbMath1490.68146OpenAlexW2965171438MaRDI QIDQ5087856
Eleni C. Akrida, Paul G. Spirakis
Publication date: 4 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626419500099
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Continuous and discrete flows over time
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Efficient continuous-time dynamic network flow algorithms
- Computation in networks of passively mobile finite-state sensors
- Distributed computation in dynamic networks
- Flooding Time of Edge-Markovian Evolving Graphs
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Labeling Schemes for Flow and Connectivity
- Temporal Network Optimization Subject to Connectivity Constraints
- Local Update Algorithms for Random Graphs
- Quickest Flows Over Time
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- On the Complexity of Information Spreading in Dynamic Networks
- Connectivity and inference problems for temporal networks
- Graph colouring and the probabilistic method
This page was built for publication: On Verifying and Maintaining Connectivity of Interval Temporal Networks
