[1] 杨彦波,刘滨,祁明月,等. 信息可视化研究综述[J]. 河北科技大学学报, 2014,35(1):91-102.
[2] 黄竞伟,康立山,陈毓屏. 一个新的无向图画图算法[J]. 软件学报, 2000,11(1):138-142.
[3] 黄竞伟. 基于遗传算法的画图算法研究[D]. 武汉:武汉大学, 2001.
[4] Koren Y, Carmel L, Harel D. Drawing huge graphs by algebraic multigrid optimization[J]. Multiscale Modeling and Simulation, 2003,1(4):645-673.
[5] 〖JP2〗Harel D, Koren Y. Graph drawing by high-dimensional embedding[J]. Journal of Graph Algorithms and Application, 2004,8(2):195-214.
[6] 〖JP2〗Eades P. A heuristic for graph drawing[J]. Congresses Numerantium, 1984,42:149-160.
[7] Kamada T, Kawai S. An algorithm for drawing general undirected graphs[J]. Information Processing Letters, 1989,31(1):7-15.
[8] Davidson R, Harel D. Drawing graphs nicely using simulated annealing[J]. ACM Transactions on Graphics(TOG), 1996,15(4):301-331.
[9] Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement[J]. Software-Practice and Experience, 1991,21(11):1129-1164.
[10]Davis L. Genetic algorithms and simulated annealing[M]. Morgan Kaufmann Publishers Inc., 1987.
[11]Rodrigues J F, Tong Hanghang, Pan Jiayu, et al. Large graph analysis in the GMine system[J]. IEEE Transactions on Knowledge & Data Engineering, 2013,25(1):106-118.
[12]Hadany R, Harel D. A multi-scale algorithm for drawing graphs nicely[J]. Discrete Applied Mathematics, 2001,113(1):3-21.
[13]Harel D, Koren Y. A fast multi-scale method for drawing large graphs[J]. Journal of Graph Algorithms and Applications, 2002,6(3):179-202.
[14]Walshaw C. A multilevel algorithm for force-directed graph drawing[J]. Journal of Graph Algorithms and Applications, 2003,7(3):253-285.
[15]Gajer P, Goodrich M T, Kobourov S G. A fast multi-dimensional algorithm for drawing large graphs[J]. Computational Geometry: Theory and Applications, 2004,29(1):3-18.[16]Hu Yifan, Scott J A. A multilevel algorithm for wavefront reduction[J]. SIAM Journal on Scientific Computing, 2001,23(4):1352-1375.
[17]Hu Yifan. Efficient and high quality force-directed graph drawing[J]. The Mathematica Journal, 2005,10(1):37-71. |