Get all the updates for this publication

Conferences

Clique-detection algorithm using clique-self-assemblyPublished in

2011

Pages: 225 - 230

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 cliqueself- 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 cliqueself- 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. © 2011 IEEE.

Topics: Clique graph (72)%72% related to the paper, Clique-sum (72)%72% related to the paper, Chordal graph (71)%71% related to the paper, Clique problem (70)%70% related to the paper and Split graph (69)%69% related to the paper

View more info for "Clique-Detection Algorithm Using Clique-Self-Assembly"

Content may be subject to copyright.

About the journal

Journal | Proceedings - 2011 6th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2011 |
---|---|

Open Access | No |

Concepts (11)

- CLIQUE-SELF-ASSEMBLY
- CLIQUES
- Graph g
- K-TREES
- MINIMAL GENERATORS
- Self-assembled
- Sufficient conditions
- Computation theory
- Graphic methods
- Self assembly
- Trees (mathematics)