首页 | 本学科首页   官方微博 | 高级检索  
     

复杂网络中重要性节点发掘综述
引用本文:赫南,李德毅,淦文燕,朱熙. 复杂网络中重要性节点发掘综述[J]. 计算机科学, 2007, 34(12): 1-5
作者姓名:赫南  李德毅  淦文燕  朱熙
作者单位:北京航空航天大学计算机系,北京,100083;电子系统工程研究所,北京,100039;清华大学计算机系,北京,100084
基金项目:国家自然科学基金 , 国家重点基础研究发展计划(973计划)
摘    要:发掘网络中重要性^1节点(边)一直是图论领域的一个基本问题。随着近年来复杂网络研究热潮的兴起,特别是很多实际网络所抽象出来的复杂网络,表现出了与以往图理论不同的特性,如小世界特性、无尺度特性等。如何在复杂网络环境下,发掘重要性节点已经成为复杂网络研究的一个基本问题。本文简要介绍了复杂网络的基本概念,详细总结、分析了在复杂网络环境下几个领域中发掘重要性节点的方法,最后提出了这一领域内几个有待深入研究的问题和可能的应用方向。

关 键 词:复杂网络  节点重要性    相对重要性

Mining Vital Nodes in Complex Networks
HE Nan,LI De-Yi,GAN Wen-Yan,ZHU Xi. Mining Vital Nodes in Complex Networks[J]. Computer Science, 2007, 34(12): 1-5
Authors:HE Nan  LI De-Yi  GAN Wen-Yan  ZHU Xi
Abstract:Mining vital nodes/edges has always been a basic problem in Graph Theory. As the study of Complex Networks has become more and more hot, especially that there are lots of real-world networks that can be modeled as Complex Networks, which also have many important properties different from those in the traditional Graph Theory, e.g. small-world property, scale-free property, etc. How to mine vital nodes in Complex Networks has become a newborn problem. This paper reviews some basic concepts of Complex Networks, summaries and analyses some classic measures of mining vital nodes in some fields, and predicts some further-studied questions and possible applications.
Keywords:Complex networks   Vital nodes   Graph   Relative importance
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号