Complexity of graph self-assembly in accretive systems and self-destructible systems

John H. Reif, Sudheer Sahu, Peng Yin. Complexity of graph self-assembly in accretive systems and self-destructible systems. Theoretical Computer Science, 412(17):1592-1605, 2011. [doi]

@article{ReifSY11,
  title = {Complexity of graph self-assembly in accretive systems and self-destructible systems},
  author = {John H. Reif and Sudheer Sahu and Peng Yin},
  year = {2011},
  doi = {10.1016/j.tcs.2010.10.034},
  url = {http://dx.doi.org/10.1016/j.tcs.2010.10.034},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ReifSY11},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {412},
  number = {17},
  pages = {1592-1605},
}