Graph Clustering Using Restricted Neighbourhood Search Algorithm

Graph Clustering Using Restricted Neighbourhood Search Algorithm

EnglishPaperback / softbackPrint on demand
Kumar, Mohit
LAP Lambert Academic Publishing
EAN: 9783659237133
Print on demand
Delivery on Friday, 28. of August 2026
€50.05
Common price €55.62
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

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
EAN 9783659237133
ISBN 3659237132
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Publication date September 14, 2012
Pages 80
Language English
Dimensions 229 x 152 x 5
Readership General
Authors Kapoor, Piyush; Kumar, Mohit
Editors Singh, Arjun
Edition Aufl.
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.