Double weighted hierarchical network algorithm based on granular computing
Runxiu Wu · Computer Engineering and Applications Journal · 2011
The data distribution optimization problem is a NP hard problem in a complex network.But the most complex net-works can be mapped into hierarchical networks,so that the computational complexity can be reduced.This paper proposes a double weighted hierarchical network model and algorithm based on granular computing theory.This algorithm maps the gen-eral double weighted complex network into the double weighted hierarchical network,and the optimal solution of data distri-bution can be solved in the hierarchical network.The algorithm time complexity is O(C×n2).And the simulation results show that the algorithm can obtain satisfactory solution by adjusting the sub-networks’s particle size.