2 search results - page 1 / 1 » On the Complexity of Graph Self-assembly in Accretive System... |
102
Voted
DNA
2005
Springer
15 years 9 months ago
2005
Springer
129
Voted
DNA
2006
Springer
15 years 7 months ago
2006
Springer
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...