Graph Clustering Using Restricted Neighbourhood Search Algorithm: an Advanced Study of Implementation and Behavioural Analysis - Piyush Kapoor - Books - LAP LAMBERT Academic Publishing - 9783659237133 - September 14, 2012
In case cover and title do not match, the title is correct

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

Price
£ 35.49

Ordered from remote warehouse

Expected delivery Jan 7 - 15, 2026
Christmas presents can be returned until 31 January
Add to your iMusic wish list
or

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

Media Books     Paperback Book   (Book with soft cover and glued back)
Released September 14, 2012
ISBN13 9783659237133
Publishers LAP LAMBERT Academic Publishing
Pages 80
Dimensions 150 × 5 × 226 mm   ·   137 g
Language German  
Contributor Arjun Singh