W. Basalaj, Proximity Visualization of Abstract Data, 2000.

G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, 1999.

I. Borg and P. Groenen, Modern multidimensional scaling, 1997.

M. Chalmers, A linear iteration time layout algorithm for visualising high-dimensional data, IEEE Symposium on Information Visualization, pp.127-132, 1996.

. Eades, A heuristic for graph drawing, Congressus Numerantium, vol.42, pp.149-160, 1984.

L. Frick and M. , A fast adaptive layout algorithm for undirected graphs, Lecture Notes in Computer Science, vol.894, pp.388-403

T. M. Fruchterman and E. M. Reingold, Graph Drawing by Force-directed Placement, Software-Practice and Experience, vol.21, pp.1129-1164, 1991.

P. Gajer, M. T. Goodrich, and S. G. Kobourov, A Fast Multi-Dimensional Algorithm for Drawing Large Graphs, Graph Drawing, 2000.

P. Gajer, M. T. Goodrich, and S. G. Kobourov, GRIP : Graph dRawing with Intelligent Placement, Graph Drawing, 2000.

T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, vol.31, pp.7-15, 1989.

M. Kaufmann and D. Wagner, Drawing Graphs, 2001.

J. B. Kruskal and M. Wish, Multidimensional Scaling, 1978.

A. Morrison, G. Ross, and M. Chalmers, A hybrid layout algorithm for sub-quadratic multidimensional scaling, IEEE Symposium on Information Visualization, p.152, 2002.

A. Morrison, G. Ross, and M. Chalmers, Fast multidimensional scaling through sampling, springs and interpolation, IEEE Symposium on Information Visualization, pp.68-77, 2003.