Connectivity preserving network transformers

DOI10.1016/J.TCS.2016.02.040MaRDI QIDQ529024zbMATH OpenOpenAlexFDO

Authors Othon Michail, P. G. Spirakis

Publication date 18 May 2017

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.02.040

zbMATH Keywords

terminationnetwork constructionpopulation protocoldynamic topologynetwork transformationcontinuous connectivityrandom schedulerturing machine simulation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Connectivity preserving network transformers
• Structure-preserving neural networks
• Structured connectivity augmentation
• Structured connectivity augmentation
• On structure-preserving connections
• Structure-preserving deep learning
• Connectivity preserving transformations for higher dimensional binary images
• scientific article; zbMATH DE number 1323825

Cites work

• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• Asynchronous pattern formation by anonymous oblivious mobile robots
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks
• Computation in networks of passively mobile finite-state sensors
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed computation in dynamic networks
• Forming sequences of geometric patterns with oblivious mobile robots
• Keeping Mobile Robot Swarms Connected
• Mediated population protocols
• Naming and counting in anonymous unknown dynamic networks
• Passively mobile communicating machines that use restricted space
• Terminating distributed construction of shapes and patterns in a fair solution of automata
• The computational power of population protocols
• The computational power of simple protocols for self-awareness on graphs
• The program-size complexity of self-assembled squares (extended abstract)
• Timing in chemical reaction networks
• Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly

Cited in

(6)

• Connectivity preserving network transformers
• Distributed computation and reconfiguration in actively dynamic networks
• Terminating distributed construction of shapes and patterns in a fair solution of automata
• Search by a metamorphic robotic system in a finite 2D square grid
• Network Constructors: A Model for Programmable Matter
• A glimpse at Paul G. Spirakis

This page was built for publication: Connectivity preserving network transformers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529024)