Share Email Print
cover

Proceedings Paper

Two improved algorithms of high degree seeking strategy for complex networks
Author(s): Yihan Zhang; Qingnian Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 5 November 2008
PDF: 8 pages
Proc. SPIE 7144, Geoinformatics 2008 and Joint Conference on GIS and Built Environment: The Built Environment and Its Dynamics, 714435 (5 November 2008); doi: 10.1117/12.812863
Show Author Affiliations
Yihan Zhang, Sun Yat-Sen Univ. (China)
Qingnian Zhang, Sun Yat-Sen Univ. (China)


Published in SPIE Proceedings Vol. 7144:
Geoinformatics 2008 and Joint Conference on GIS and Built Environment: The Built Environment and Its Dynamics
Lin Liu; Xia Li; Kai Liu; Xinchang Zhang; Xinhao Wang, Editor(s)

© SPIE. Terms of Use
Back to Top