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

From MaRDI portal
Revision as of 14:02, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    OpenAlex ID
    W2034199804
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q934978&oldid=35065173"
    Powered by MediaWiki