Self Assembling Graphs
Copyright policy )Self Assembling Graphs
A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process algebra, extends Klavins' original proposal, in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins' method dealt only with trees.
- French National Centre for Scientific Research France
- University of Paris France
- University of Paris France
- UNIVERSITE PARIS DESCARTES France
- Centre d’Economie Industrielle - CERNA France
Concurrency theory, Graph theory (including graph drawing) in computer science, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms, [INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA], concurrency theory, process algebra, distributed algorithm theory
Concurrency theory, Graph theory (including graph drawing) in computer science, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms, [INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA], concurrency theory, process algebra, distributed algorithm theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!