On the Complexity of Graph Self-assembly in Accretive Systems
From MaRDI portal
Publication:5452564
DOI10.1007/11925903_8zbMath1132.68387OpenAlexW1507613946MaRDI QIDQ5452564
Sanjeev Khanna, Mirkó Visontai, Stanislav Angelov
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
Related Items (2)
Growing self-organizing trees for autonomous hierarchical clustering ⋮ Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
This page was built for publication: On the Complexity of Graph Self-assembly in Accretive Systems
