On the complexity of graph self-assembly in accretive systems

DOI10.1007/s11047-007-9048-6zbMath1146.68056OpenAlexW2034199804MaRDI QIDQ934978

Mirkó Visontai, Sanjeev Khanna, Stanislav Angelov

Publication date: 31 July 2008

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-007-9048-6

zbMATH Keywords

computational complexityaccretive systemsgraph self-assembly

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Robust self-assembly of graphs ⋮ Robust Self-assembly of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• Self-assembling DNA graphs
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Reducing tile complexity for self-assembly through temperature programming
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• Planar Formulae and Their Uses
• Spanning trees with many or few colors in edge-colored graphs
• Running time and program size for self-assembled squares
• Unconventional Computation
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing

This page was built for publication: On the complexity of graph self-assembly in accretive systems