Two Improved Algorithms of High Degree Seeking Strategy for Complex Networks
Recently complex networks have aroused the attention from a number of scholars,raising the upsurge of studying complex networks.High degree seeking strategy (DS) has been proved to be an effective algorithm of searching complex networks.This paper puts forward two algorithms to improve the high degree seeking strategy (DS) by adding two criteria to the selection of neighboring nodes.According to the improved algorithms,the degrees of and distances to the neighbors neighbor will be compared when two or more neighbors of the currently processed node have the highest degree.Experiments are carried out to compare the efficiency of the high degree seeking strategy and its improved versions.Case studies show that the improved algorithms are more efficient than the original one when searching in a network with a huge number of nodes.
Complex network High degree seeking strategy (DS) Algorithm Improvement
Zhang Yihan Zhang Qingnian
Department of Remote Sensing and GIS Engineering,Sun Yat-Sen University,Guangzhou,510275,China
国际会议
第16届国际地理信息科学与技术大会(16th International Conference on GeoInformatics and the Joint Conference)
广州
英文
2008-06-28（万方平台首次上网日期，不代表论文的发表时间）