Self-assembling graphs

DOI10.1007/s11047-006-9013-9zbMath1130.68080OpenAlexW1990968091MaRDI QIDQ2461296

Vincent Danos, Fabien Tarissan

Publication date: 27 November 2007

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-006-9013-9

zbMATH Keywords

process algebraconcurrency theorydistributed algorithm theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items (3)

Growing self-organizing trees for autonomous hierarchical clustering ⋮ Self-assembling graphs ⋮ A Simple Calculus for Proteins and Cells

Cites Work

• Formal molecular biology
• Self-assembling graphs
• Self-assembling Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Self-assembling graphs