A Max-Min Degree Search Algorithm in Scale-Free Networks

Many real complex networks have the scale-free feature,in which high degree nodes play an important role.This paper investigates search algorithm in scale-free networks.High-degree-based search algorithm works well only when the power-law exponent is between 2.0 and 2.3.The paper improves this algorithm and presents a max-min degree local search strategy which works well for scale-free networks with larger power-law exponents.Compared with such well-known strategies as random walk and high-degree seeking,the max-min degree search makes further use of degree distributions of scale-free networks.Theoretical analysis and relative simulation results in this paper are given to prove its feasibility.