计算机应用与软件2011，Vol.28Issue(11)：99-101,144,4.
网络的粒度存储及在路径搜索中的应用
NETWORK GRANULAR STORAGE AND ITS APPLICATION TO PATH FINDING
摘要
Abstract
Network path finding is a classical problem in the graph theory. For large scale networks, the shortest path finding problem is a hot issue for researching in the AI field. The thesis applies a problem solving idea of granular computing methods to realize network granular storage, discusses different fundamental types of network granulation, and proposes a hierarchical quotient space chain to realize network granular storage. For large scale networks, a network quick partitioning method is put forward that regards communities as basic granules to realize network granular storage. In addition, the paper regards network granular storage hierarchical quotient space chain information as preprocessing work before path finding and proposes a heuristic path finding method. Through comparison between experiments and heuristic path finding methods, the effectiveness of the proposed algorithm is validated.关键词
粒计算/商空间理论/粒度存储/最短路径Key words
Granular computing Quotient space theory Granular storage Shortest path分类
信息技术与安全科学引用本文复制引用
何富贵,张燕平,张铃..网络的粒度存储及在路径搜索中的应用[J].计算机应用与软件,2011,28(11):99-101,144,4.基金项目
2011中国计算机大会论文.国家自然科学基金(61073117) （61073117）
国家重点基础研究发展计划项目(2007CB311003) （2007CB311003）
安徽省高校青年杰出基金(2009SQRZ0202ZD,2010SQRL021) （2009SQRZ0202ZD,2010SQRL021）
安徽省自然科学基金(11040606M145) （11040606M145）
