Distributed computation and reconfiguration in actively dynamic networks
DOI10.1007/s00446-021-00415-5zbMath1483.68031OpenAlexW3009337175MaRDI QIDQ2121068
Othon Michail, George Skretas, Paul G. Spirakis
Publication date: 1 April 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-021-00415-5
transformationdistributed algorithmsdynamic networksreconfigurationedge complexitypolylogarithmic time
Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Connectivity preserving network transformers
- Mediated population protocols
- Temporal network optimization subject to connectivity constraints
- On the transformation capability of feasible mechanisms for programmable matter
- The computational power of population protocols
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Faster construction of overlay networks
- Computation in networks of passively mobile finite-state sensors
- Deleting edges to restrict the size of an epidemic in temporal networks
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
- Distributed computation in dynamic networks
- Naming and Counting in Anonymous Unknown Dynamic Networks
- Skip graphs
- On the Complexity of Local Graph Transformations
- Distributed Monitoring of Network Properties: The Power of Hybrid Networks
- Distributed Computation and Reconfiguration in Actively Dynamic Networks
- Simple and efficient local codes for distributed stable network construction
- Connectivity and inference problems for temporal networks
This page was built for publication: Distributed computation and reconfiguration in actively dynamic networks
