计算机工程与科学2017，Vol.39Issue(8)：1471-1475,5.DOI:10.3969/j.issn.1007-130X.2017.08.013
基于分层递阶商空间链的图连通性研究
Graph connectivity based on hierarchical quotient space chain
摘要
Abstract
Judgment of graph connectivity is significant for judging the connectivity between any two points and the division of the connecting block in path planning.We analyze graph hierarchy by starting from edge connectivity relationship,and obtain the distribution of each node on different levels in the chain by constructing a graph hierarchical quotient space chain,thus achieving a new method of judging graph connectivity.Compared with conventional methods,it has the advantages of high efficiency and is easy to implement.It can not only effectively determine graph connectivity but also the branch number,and identify which node is located in the same connected component in the graph.关键词
分层递阶商空间链/图连通性/连通分支/等价划分Key words
hierarchical quotient space chain/graph connectivity/connected component/equivalence partition分类
信息技术与安全科学引用本文复制引用
周敏,王加阳,龙陈锋,陈林书..基于分层递阶商空间链的图连通性研究[J].计算机工程与科学,2017,39(8):1471-1475,5.基金项目
国家自然科学基金(61173052) （61173052）
湖南省自然科学基金(14JJ4007) （14JJ4007）
湖南省教育厅优秀青年项目(12B061) （12B061）
