[1]
BATTISTA G D, EADES P, TAMASSIA R, et al. Algorithms for drawing graphs: An annotated bibliography[J]. Computational Geometry: Theory and Applications, 1994, 4(5): 235-282.
[2]
EADES P. A heuristic for graph drawing[J]. Congressus Numerantium, 1984,42: 149-160.
[3]
FRUCHTERMAN T M J, REINGOLD E M. Graph drawing by force-directed placement[J]. Software—Practice and Experience, 1991, 21(11):1129-1164.
[4]
方文其,胡明晓.无向关系图视觉清晰化显示算法[J].计算机工程与科学,2011,33(6):51-56.
[5]
ELORANTA T, MKINEN E. TimGA: A genetic algorithm for drawing undirected graphs [J]. Divulgaciones Matematicas, 2001, 9(2): 155-171.
[6]
黄竞伟,康立山,陈毓屏.一个新的无向图画图算法[J].软件学报,2000,11(1):138-142.
[7]
张清国,叶俊民,张维,等.用遗传算法画无向图[J].计算机工程与科学,2006,28(6):58-61.
[8]
何慧,张伟哲,张宏莉,等.基于MLkP/CR算法的无向图分割方法:中国,200910073338.9[P].2010-06-16.
[9]
张磊,孙松,李经通,等.网络拓扑图形化显示方法及装置:中国,200910011924.0[P]. 2009-11-18.