计算机工程与科学2011，Vol.33Issue(6)：51-56,6.DOI:10.3969/j.issn.1007-130X.2011.06.011
无向关系图视觉清晰化显示算法
A Visually Clarifying Display Algorithm for Undirected Relation Graphs
摘要
Abstract
A visually clarifying display algorithm for undirected relation graphs is proposed in this paper. Given an ordinary undirected relation graph, after it is processed by the novel algorithm determining the new positions of the vertices, it becomes more clear in aesthetic criteria. First, for a given graph, any isolated vertices are deleted, all the connected branches are decomposed. For each connected branch, it is decomposed into several cliques linked as a tree via recognizing the cut edges (bridges). Then the cliques are decomposed into several subcliques via recognizing the cut vertices. Finally, the vertices in the subclique are uniformly located in a circle. The algorithm is featured with convenient implementation, simple model, fast processing, clear output results and easy parallelization.关键词
无向图/清晰化显示/割边/割点/团Key words
undirected graph/clarifying display/cut edge/cut vertex/clique分类
信息技术与安全科学引用本文复制引用
方文其,胡明晓..无向关系图视觉清晰化显示算法[J].计算机工程与科学,2011,33(6):51-56,6.基金项目
浙江省新苗人才计划资助项目(团浙联[2010]15号) （团浙联[2010]15号）
温州市科技局资助项目(H20090049) （H20090049）
