1 |
W. Tutte, "How to draw a graph," In Proceedings of the London Mathematical Society, Vol. 3, No. 13, pp. 743-768, 1963.
|
2 |
M. Juenger and P. Mutzel, "2-layer straightline crossing minimization: Performance of exact and heuristic algorithms," Journal of Graph Algorithms and Applications, Vol. 1, pp. 33-59, 1997.
|
3 |
M. R. Laguna, R. Marti, and V. Vals, "Arc crossing minimization in hierarchical digraphs with tabu search," Computers and Operations Research, Vol. 24, No. 12, pp. 1165-1186, 1997.
|
4 |
M. Laguna and R. Marti, "GRASP and path relinking for 2-layer straight line crossing minimization," INFORMS Journal on Computing, Vol. 11, pp. 44-52, 1999.
DOI
|
5 |
D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
|
6 |
J. W. Sammon, Jr, "A non-linear mapping for data structure analysis," IEEE Transactions on Computers, Vol. 18, pp. 401-409, 1969.
DOI
|
7 |
Y.-H. Kim and B.-R. Moon, "New usage of Sammon’s mapping for genetic visualization," In Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1136-1147, 2003.
|
8 |
C. Bennett, J. Ryall, L. Spalteholz, and A. Gooch, "The aesthetics of graph visualization," Computational Aesthetics in Graphics, Visualization and Imaging, pp. 1-8, 2007.
|
9 |
M. Srinivas and L. M. Patnaik, "Genetic algorithms: A survey," IEEE Computer, Vol. 27, pp. 17-26, 1994.
|
10 |
G. di Battista, P. Eades, R. Tamassia, and I. G. Tollis, "Algorithms for drawing graphs: An annotated bibliography," Computational Geometry: Theory and Applications, Vol. 4, No. 5, pp. 235-282, 1994.
DOI
ScienceOn
|
11 |
I. Herman, G. Melançon, and M. S. Marshall. "Graph visualization and navigation in information visualization: A survey," IEEE Transactions on Visualization and Computer Graphics, Vol. 6, pp. 24-43, 2000.
DOI
|
12 |
H. C. Purchase, "Which aesthetic has the greatest effect on human understanding?" In Proceedings of the Symposium on Graph Drawing, pp. 248-261, 1997.
|
13 |
H. C. Purchase, R. F. Cohen, and M. James, "Validating graph drawing aesthetics," In Proceedings of the Symposium on Graph Drawing, pp. 435-446, 1995.
|
14 |
H. C. Purchase, R. F. Cohen, and M. James, "An experimental study of the basis for graph drawing algorithms," ACM Journal of Experimental Algorithmics, Vol. 2, No. 4, 1997.
|
15 |
M. R. Garey and D. S. Johnson, "Crossing number is NP-complete," SIAM Journal of Algebraic and Discrete Methods, Vol. 4, No. 3, pp. 312-316, 1983.
DOI
|
16 |
P. Eades and S. H. Whitesides, "Drawing graphs in two layers," Theoretical Computer Science, Vol. 131, No. 2, pp. 361-374, 1994.
DOI
|