On the complexity of graph self-assembly in accretive systems.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/nc/AngelovKV08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/nc/AngelovKV08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mirk%E2%88%9A%E2%89%A5_Visontai
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Khanna
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stanislav_Angelov
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs11047-007-9048-6
>
foaf:
homepage
<
https://doi.org/10.1007/s11047-007-9048-6
>
dc:
identifier
DBLP journals/nc/AngelovKV08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs11047-007-9048-6
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/nc
>
rdfs:
label
On the complexity of graph self-assembly in accretive systems.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mirk%E2%88%9A%E2%89%A5_Visontai
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Khanna
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stanislav_Angelov
>
swrc:
number
2
(xsd:string)
swrc:
pages
183-201
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/nc/AngelovKV08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/nc/AngelovKV08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/nc/nc7.html#AngelovKV08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s11047-007-9048-6
>
dc:
subject
Graph self-assembly; Accretive systems; Computational complexity
(xsd:string)
dc:
title
On the complexity of graph self-assembly in accretive systems.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
7
(xsd:string)