Graph Clustering Using Restricted Neighbourhood Search Algorithm: an Advanced Study of Implementation and Behavioural Analysis

Restricted Neighborhood Search Algorithm(R. N. S. C)is a cost-based clustering technique for clustering the graph into separate clusters, where each cluster has some similar properties. Based on a practitioner's insights, the book focuses on the basic principles and dwells on the complex details of graph clustering using Restricted Neighbourhood Search. The book covers the following: Introduction Experimental results Test Data Random graph Color benchmark graph Parameter training and statistical results Cluster limit Diversification Tabu length Search length Graph coloring