Robust Self-assembly of Graphs

DOI10.1007/978-3-642-03076-5_11MaRDI QIDQ3643098zbMATH OpenOpenAlexFDO

Authors Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai

Publication date 10 November 2009

Published in DNA Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03076-5_11

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)

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

• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• DNA Computing
• DNA Computing
• On the complexity of graph self-assembly in accretive systems
• Planar Formulae and Their Uses
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(5)

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

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 Q3643098)