On the complexity of graph self-assembly in accretive systems (Q934978)

From MaRDI portal
Revision as of 18:43, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the complexity of graph self-assembly in accretive systems
scientific article

    Statements

    title
    On the complexity of graph self-assembly in accretive systems (English)
    0 references
    author
    Stanislav Angelov
    0 references
    Sanjeev Khanna
    0 references
    Mirkó Visontai
    0 references
    publication date
    31 July 2008
    0 references
    zbMATH DE Number
    5306395
    0 references
    zbMATH Keywords
    graph self-assembly
    0 references
    accretive systems
    0 references
    computational complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q934978&oldid=12905207"
    Powered by MediaWiki