Application of Graph Algorithms on Molecular Switching Devices
Molecular computing is a promising area for researchers from several disciplines. Currently many application-oriented scientists are turning towards molecular computing with the goal to develop a molecular computer. Digital circuits for molecular devices are designed at the molecular level. A digital circuit will be thousands times smaller if switching elements can be developed from appropriate molecules by using a direct chemical procedure. In order to explore the computational power of such devices, it is important to study them on abstract models. The concept of soliton automation has been introduced to model this phenomenon using graph matchings. The algorithms developed in this research work largely contribute to the research on soliton graphs and automata.
30 Nov -0001
Strategic Research Theme
Information and Communication Technology