论文信息 - A Meta Heuristic for Graph Drawing. - 字舞流文

A Meta Heuristic for Graph Drawing.

Oliver Niggemann | Benno Stein

[1] Roberto Tamassia,et al. On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[2] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .

[3] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4] D. R. Woods. Drawing planar graphs , 1981 .

[5] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[6] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[7] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[8] Thomas H. Wonnacott,et al. Regression: A Second Course in Statistics. , 1981 .