[1] |
杨彦波,刘滨,祁明月. 信息可视化研究综述[J]. 河北科技大学学报, 2014,35(1):91-102.
|
[2] |
黄竞伟,康立山,陈毓屏. 一个新的无向图画图算法[J]. 软件学报, 2000,11(1):138-142.
|
[3] |
Eades P. A heuristci graph drawing[C]// Congressus Numerantium. 1984,42(11):149-160.
|
[4] |
Kamada T, Kawai S. An algorithm for drawing general undirected graphs[J]. Information Processing Letters,
|
19 |
89,31(1):7-15.
|
[5] |
Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement[J]. Software-Practice and
|
|
Experience, 1991,21(11):1129-1164.
|
[6] |
Walshaw C. A multilevel algorithm for force-directed graph drawing[C]// Proceedings of the 8th
|
|
International Symposium on Graph Drawing. 2001,1984:171-182.
|
[7] |
Hadany R, Harel D. A multi-scale algorithm for drawing graphs nicely[J]. Discrete Applied Mathematics,
|
20 |
01,113(1):3-21.
|
[8] |
Hu Yifan. Efficient and high-quality force-directed graph drawing[J]. The Mathematica Journal,
|
20 |
05,10:37-71.
|
[9] |
Rodrigues J F, Tong Hanghang, Pan Jiayu, et al. Large graph analysis in the GMine system[J]. IEEE
|
|
Transactions on Knowledge and Data Engineering, 2013,25(1):106-118.
|
[10] |
张清国,黄竞伟. 一个无向平面图的画图算法[J]. 小型微型计算机系统, 2003,24(6):972-975.
|
[11] |
黄竞伟. 基于遗传算法的画图算法研究[D]. 武汉:武汉大学, 2001.
|
[12] |
张清国,叶俊民,张维,等. 用遗传算法画无向图[J]. 计算机工程与科学, 2006,28(6):58-61.
|
[13] |
Harel D, Koren Y. Graph drawing by high-dimensional embedding[C]// Proceedings of the 9th International
|
|
Symposium on Graph Drawing. 2002:207-219.
|
[14] |
Becker R A, Eick S G, Wilks A R. Visualizing network data[J]. IEEE Transactions on Visualization and
|
|
Computer Graphics, 1995,1(1):16-28.
|
[15] |
Lim C P, Wang S L, Tan K S., et al. Use of the circle segments visualization technique for neural network
|
|
feature selection and analysis[J]. Neurocomputing, 2010,73(4/6):613-621.
|
[16] |
Van Laarhoven P J M, Aarts E H L. Simulated Annealing[M]. Springer Netherlands, 1987.
|
[17] |
Davis L. Genetic Algorithms and Simulated Annealing[M]. OSTI, 1987.
|