Robust Self-assembly of Graphs

DOI10.1007/978-3-642-03076-5_11zbMath1258.68053OpenAlexW2156530018MaRDI QIDQ3643098

Mirkó Visontai, Sanjeev Khanna, Stanislav Angelov

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

Cites Work

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

This page was built for publication: Robust Self-assembly of Graphs