On the complexity of graph self-assembly in accretive systems
type: Item
instance of: scholarly article
title: On the complexity of graph self-assembly in accretive systems
zbMATH Open document ID: 1146.68056
author: Stanislav Angelov
author: Sanjeev Khanna
author: Mirkó Visontai
published in: Natural Computing
publication date: 2008-07-31T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5306395
zbMATH Keywords: graph self-assembly
zbMATH Keywords: accretive systems
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: s11047-007-9048-6
OpenAlex ID: W2034199804
cites work: Running time and program size for self-assembled squares
cites work: Combinatorial optimization problems in self-assembly
cites work: Q5501350
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: Q5501351
cites work: DNA Computing
cites work: Unconventional Computation
cites work: Reducing tile complexity for self-assembly through temperature programming
cites work: Q4762326
cites work: Planar Formulae and Their Uses
cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
cites work: The program-size complexity of self-assembled squares (extended abstract)
cites work: Self-assembling DNA graphs
cites work: Programmable Control of Nucleation for Algorithmic Self-Assembly
DOI: 10.1007/S11047-007-9048-6
description: scientific article; zbMATH DE number 5306395