RANGE-BASED GRAPH CLUSTERING

Now showing item 1 of 1

Title:	RANGE-BASED GRAPH CLUSTERING
Author:	LUO, YONGFENG
Description:	Small-world networks received more and more attention in different research areas. The research of this phenomenon affects the study of biology, computer networks and many other disciplines due to the good characteristics such as short path length between nodes and robust connectivity. In the paper, a survey on the research of small-world network is given and shortcuts - long range edges ¨C are specially focused. Based on the analysis of this, a range-based graph clustering method, which would nicely show the center, the backbone and infrastructure of large-scaled, complex network in terms of path length and connectivity, is proposed. The case study of uc.edu and oz.uc.edu networks at web page level, which was as a snapshot of each virtual network in March 2000, shows that the range-based graph clustering works well and achieves reasonable results and is helpful in understanding the structure of the web world.
Permanent Link:	http://rave.ohiolink.edu/etdc/view?acc_num=ucin1014606422 http://hdl.handle.net/2374.OX/10679
Date:	2002

Files in this item

Files	Size	Format	View
There are no files associated with this item.

Now showing item 1 of 1