FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4230829138> ?p ?o ?g. }

• W4230829138 endingPage "133" @default.
• W4230829138 startingPage "111" @default.
• W4230829138 abstract "Self-assembly is a process in which small building blocks interact autonomously to form larger structures. A recently studied model of self-assembly is the Accretive Graph Assembly Model whereby an edge-weighted graph is assembled one vertex at a time starting from a designated seed vertex. The weight of an edge specifies the magnitude of attraction (positive weight) or repulsion (negative weight) between adjacent vertices. It is feasible to add a vertex to the assembly if the total attraction minus repulsion of the already built neighbors exceeds a certain threshold, called the assembly temperature. This model naturally generalizes the extensively studied Tile Assembly Model. A natural question in graph self-assembly is to determine whether or not there exists a sequence of feasible vertex additions to realize the entire graph. However, even when it is feasible to realize the assembly, not much can be inferred about its likelihood of realization in practice due to the uncontrolled nature of the self-assembly process. Motivated by this, we introduce the robust self-assembly problem where the goal is to determine if every possible sequence of feasible vertex additions leads to the completion of the assembly. We show that the robust self-assembly problem is co-NP-complete even on planar graphs with two distinct edge weights. We then examine the tractability of the robust self-assembly problem on a natural subclass of planar graphs, namely grid graphs. We identify structural conditions that determine whether or not a grid graph can be robustly self-assembled, and give poly-time algorithms to determine this for several interesting cases of the problem. Finally, we also show that the problem of counting the number of feasible orderings that lead to the completion of an assembly is #P-complete." @default.
• W4230829138 created "2022-05-11" @default.
• W4230829138 creator A5025237352 @default.
• W4230829138 creator A5039619350 @default.
• W4230829138 creator A5078183964 @default.
• W4230829138 date "2009-10-01" @default.
• W4230829138 modified "2023-09-25" @default.
• W4230829138 title "Robust self-assembly of graphs" @default.
• W4230829138 cites W1567090568 @default.
• W4230829138 cites W1982939827 @default.
• W4230829138 cites W1983241546 @default.
• W4230829138 cites W1984408592 @default.
• W4230829138 cites W2006912660 @default.
• W4230829138 cites W2027804504 @default.
• W4230829138 cites W2034199804 @default.
• W4230829138 cites W2042481641 @default.
• W4230829138 cites W2066577300 @default.
• W4230829138 cites W2068744615 @default.
• W4230829138 cites W2079833031 @default.
• W4230829138 cites W2163041701 @default.
• W4230829138 cites W2169767423 @default.
• W4230829138 doi "https://doi.org/10.1007/s11047-009-9149-5" @default.
• W4230829138 hasPublicationYear "2009" @default.
• W4230829138 type Work @default.
• W4230829138 citedByCount "0" @default.
• W4230829138 crossrefType "journal-article" @default.
• W4230829138 hasAuthorship W4230829138A5025237352 @default.
• W4230829138 hasAuthorship W4230829138A5039619350 @default.
• W4230829138 hasAuthorship W4230829138A5078183964 @default.
• W4230829138 hasBestOaLocation W42308291382 @default.
• W4230829138 hasConcept C101837359 @default.
• W4230829138 hasConcept C11413529 @default.
• W4230829138 hasConcept C114614502 @default.
• W4230829138 hasConcept C132525143 @default.
• W4230829138 hasConcept C184720557 @default.
• W4230829138 hasConcept C187691185 @default.
• W4230829138 hasConcept C24858836 @default.
• W4230829138 hasConcept C2524010 @default.
• W4230829138 hasConcept C33923547 @default.
• W4230829138 hasConcept C41008148 @default.
• W4230829138 hasConcept C80899671 @default.
• W4230829138 hasConceptScore W4230829138C101837359 @default.
• W4230829138 hasConceptScore W4230829138C11413529 @default.
• W4230829138 hasConceptScore W4230829138C114614502 @default.
• W4230829138 hasConceptScore W4230829138C132525143 @default.
• W4230829138 hasConceptScore W4230829138C184720557 @default.
• W4230829138 hasConceptScore W4230829138C187691185 @default.
• W4230829138 hasConceptScore W4230829138C24858836 @default.
• W4230829138 hasConceptScore W4230829138C2524010 @default.
• W4230829138 hasConceptScore W4230829138C33923547 @default.
• W4230829138 hasConceptScore W4230829138C41008148 @default.
• W4230829138 hasConceptScore W4230829138C80899671 @default.
• W4230829138 hasIssue "1" @default.
• W4230829138 hasLocation W42308291381 @default.
• W4230829138 hasLocation W42308291382 @default.
• W4230829138 hasOpenAccess W4230829138 @default.
• W4230829138 hasPrimaryLocation W42308291381 @default.
• W4230829138 hasRelatedWork W1719252778 @default.
• W4230829138 hasRelatedWork W2006947206 @default.
• W4230829138 hasRelatedWork W2019255250 @default.
• W4230829138 hasRelatedWork W2400746548 @default.
• W4230829138 hasRelatedWork W2983736839 @default.
• W4230829138 hasRelatedWork W3015759841 @default.
• W4230829138 hasRelatedWork W4206560000 @default.
• W4230829138 hasRelatedWork W4226175138 @default.
• W4230829138 hasRelatedWork W4287756435 @default.
• W4230829138 hasRelatedWork W4295995756 @default.
• W4230829138 hasVolume "9" @default.
• W4230829138 isParatext "false" @default.
• W4230829138 isRetracted "false" @default.
• W4230829138 workType "article" @default.