Robust self-assembly of graphs

DOI10.1007/S11047-009-9149-5MaRDI QIDQ968405zbMATH OpenOpenAlexFDO

Authors Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai

Publication date 5 May 2010

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-009-9149-5

zbMATH Keywords

computational complexityaccretive systemsrobust graph self-assembly

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Robust Self-assembly of Graphs
• Self-assembling graphs
• Multiset-based self-assembly of graphs
• scientific article; zbMATH DE number 5016703
• On the Complexity of Graph Self-assembly in Accretive Systems
• On the complexity of graph self-assembly in accretive systems
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• On aggregation in multiset-based self-assembly of graphs
• Self-assembly of geometric space from random graphs

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• DNA Computing
• DNA Computing
• On the complexity of graph self-assembly in accretive systems
• Planar Formulae and Their Uses
• The complexity of computing the permanent
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(7)

• Robust Self-assembly of Graphs
• How to build a graph in \(n\) days: some variations of graph assembly
• Multiset-based self-assembly of graphs
• On the complexity of graph self-assembly in accretive systems
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• Self-Replicability of Composite Graph Reproduction System
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems

This page was built for publication: Robust self-assembly of graphs

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