@article{(Open Science Index):https://publications.waset.org/pdf/16745,
	  title     = {A New Effective Local Search Heuristic for the Maximum Clique Problem},
	  author    = {S. Balaji},
	  country	= {},
	  institution	= {},
	  abstract     = {An edge based local search algorithm, called ELS, is proposed for the maximum clique problem (MCP), a well-known combinatorial optimization problem. ELS is a two phased local search method effectively £nds the near optimal solutions for the MCP. A parameter ’support’ of vertices de£ned in the ELS greatly reduces the more number of random selections among vertices and also the number of iterations and running times. Computational results on BHOSLIB and DIMACS benchmark graphs indicate that ELS is capable of achieving state-of-the-art-performance for the maximum clique with reasonable average running times.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {7},
	  number    = {5},
	  year      = {2013},
	  pages     = {837 - 843},
	  ee        = {https://publications.waset.org/pdf/16745},
	  url   	= {https://publications.waset.org/vol/77},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 77, 2013},
	}