Proceedings ArticleDOI
Clique-Detection Algorithm Using Clique-Self-Assembly
Raghavan Rama,Suresh Badarla,Kamala Krithivasan +2 more
- pp 225-230
TLDR
This work answers the question: Can a given set of graphs be generated through the self-assembly of clique-self-assembly and concludes that the problem of finding the generator is decidable.Abstract:
Self-assembly is a process in which simple objects autonomously combine themselves into larger objects. It is considered as a promising technique in nano-technology. Two simple graphs G1 and G2 with a clique of same size overlap and a new self-assembled graph is formed. Besides studying the properties of self assembled graphs on cliques, we answer the question: Can a given set of graphs be generated through the self-assembly of cliques? If so, how to find the generator that could generate the given set of graphs by the process of clique-self-assembly. The question of the existence of minimal generator is also discussed. The necessary and sufficient condition for a graph H to be obtained by the iterated clique-self-assembly of the graph G is also answered. We also conclude that the problem of finding the generator is decidable. We note the importance of our work with respect to several closely related clique finding problem.read more
References
More filters
Book ChapterDOI
Complexity of graph self-assembly in accretive systems and self-destructible systems
TL;DR: In this paper, the authors study the complexity of the assembly resulting from the cooperative effect of repulsion and attraction in a more general setting of graphs and show that counting the number of sequential assembly orderings that result in a target graph is #P-complete.
Journal Article
Complexity of graph self-assembly in accretive systems and self-destructible systems
TL;DR: This paper defines two novel assembly models, namely the accretive graph assembly model and the self-destructible graph Assembly model, and identifies one fundamental problem in them: the sequential construction of a given graph, referred to as Accretive Graph Assembly Problem and Self-Destructible Graph Assembly problem, respectively.
Journal ArticleDOI
Self-assembly of strings and languages
TL;DR: This paper proposes in this paper a string-based framework inspired by the principle of self-assembly: two strings with a common overlap, say uv and vw, yield a string uvw; it is said that string uVw has been assembled from strings uvand vw.
Proceedings ArticleDOI
Self-assembly of graphs
TL;DR: This paper proposes a graph-based self-assembly model and answers the question: can a given set of graphs be generated through the process of self- assembly and concludes that the problem of finding the generator is decidable.