On the Complexity of Graph Self-assembly in Accretive Systems
From MaRDI portal
Publication:5452564
DOI10.1007/11925903_8zbMATH Open1132.68387OpenAlexW1507613946MaRDI QIDQ5452564FDOQ5452564
Authors: Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai 
Publication date: 4 April 2008
Published in: DNA Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11925903_8
Recommendations
- 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
- Minimal tile and bond-edge types for self-assembling DNA graphs
- Robust Self-assembly of Graphs
Cited In (8)
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- On aggregation in multiset-based self-assembly of graphs
- Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
- Robust self-assembly of graphs
- Growing self-organizing trees for autonomous hierarchical clustering
- Robust Self-assembly of Graphs
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
- On the complexity of graph self-assembly in accretive systems
This page was built for publication: On the Complexity of Graph Self-assembly in Accretive Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452564)
