Sciweavers

2 search results - page 1 / 1
» Complexity of Graph Self-assembly in Accretive Systems and S...
Sort
View
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
13 years 9 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...