DocumentCode
2560392
Title
Solving max-clique using cellular neural network
Author
Reddy, Y. Santosh
Author_Institution
NIT, Orissa, India
fYear
2005
fDate
28-30 May 2005
Firstpage
89
Lastpage
93
Abstract
In this paper, we present an artificial life method of the cellular neural network for max-clique problem. The method is intended to provide an optimum parallel algorithm for solving the max-clique problem. To do this we use the cellular neural network to get a maximum clique. Some of the instances are simulated to verify the proposed method with the simulation results showing that the solution quality is superior to that of best existing parallel algorithm. We also test the learning method on total coloring problem.
Keywords
artificial life; cellular neural nets; graph colouring; learning (artificial intelligence); optimisation; parallel algorithms; artificial life; cellular neural network; learning; max-clique problem; optimum parallel algorithm; total coloring problem; Automata; Cellular neural networks; Multiprocessor interconnection networks; NP-complete problem; Neural networks; Parallel algorithms; Problem-solving; State-space methods; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Cellular Neural Networks and Their Applications, 2005 9th International Workshop on
Print_ISBN
0-7803-9185-3
Type
conf
DOI
10.1109/CNNA.2005.1543168
Filename
1543168
Link To Document