Robust self-assembly of graphs

DOI10.1007/S11047-009-9149-5zbMATH Open1213.68425OpenAlexW4230829138MaRDI QIDQ968405FDOQ968405

Mirkó Visontai, Sanjeev Khanna, Stanislav Angelov

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

Recommendations

• Robust Self-assembly of Graphs
• Self-assembling graphs
• Multiset-based self-assembly of graphs
• scientific article
• 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

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)

Cites Work

• The program-size complexity of self-assembled squares (extended abstract)
• DNA Computing
• The complexity of computing the permanent
• Planar Formulae and Their Uses
• Title not available (Why is that?)
• DNA Computing
• On the complexity of graph self-assembly in accretive systems

Cited In (3)

• Robust Self-assembly of Graphs
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• 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 Q968405)