Self-organizing maps for drawing large graphs

Information Processing Letters

Volumn 67, Issue 4, 1998, Pages 177-184

  Bonabeau, Eric ^a,b   Hénaux, Florian ^c  

^a SANTA FE INSTITUTE   (United States)

^b ADVANCED TELECOMMUNICATIONS RESEARCH INSTITUTE INTERNATIONAL   (Japan)

^c TELECOM PARISTECH   (France)

Author keywords

Algorithms; Force directed algorithm; Graph drawing; Neural networks; Self organizing maps

Indexed keywords

EID: 0000031228     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00108-2     Document Type: Article

References (20)

1. G.D. Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. 4 (1994) 235-282.
2. B. Becker, G. Hotz, On the optimal layout of planar graphs with fixed boundary, SIAM J. Comput. 16 (1987) 946-972.
3. F.J. Brandenburg, M. Himsolt, C. Rohrer, An experimental comparison of force-directed and randomized graph drawing algorithms, in: Proc. Graph Drawing '95, Lecture Notes in Computer Sci., Vol. 1027, Springer, Berlin, 1995, pp. 76-87.
4. R.-I. Chang, P.-Y. Hsiao, VLSI circuit placement with rectilinear modules using three-layer force-directed self-organizing maps, IEEE Trans. Neur. Net. 8 (1997) 1049-1064.
5. M.K. Coleman, D.S. Parker, Aesthetics-based graph layout for human consumption, Software Practice and Experience 26 (1996) 1-25.
6. R. Davidson, D. Harel, Drawing graphs nicely using simulated annealing, ACM Trans. Graphics 15 (1996) 301-331.
7. P. Eades, A heuristic for graph drawing, Congr. Numer. 42 (1984) 149-160.
8. A. Frick, A. Ludwig, H. Mehldau, A fast adaptive layout algorithm for undirected graphs, in: Proc. Graph Drawing '94, Lecture Notes in Computer Sci., Vol. 894, Springer, Berlin, 1994, pp. 388-403.
9. T.M.J. Fruchterman, E.M. Reingold, Graph drawing by force-directed placement, Software Practice and Experience 21 (1991) 1129-1164.
10. J. Garbers, H.J. Prömel, A. Steger, Finding clusters in VLSI circuits, in: A. Sangiovanni-Vincentinelli, S. Goto (Eds.), Proc. IEEE Int. Conf. on Computer-Aided Design, IEEE Computer Society Press, 1990, pp. 520-523.
11. A. Hemani, A. Postula, Cell placement by self-organization, Neural Networks 3 (1990) 377-383.
12. T. Kamada, Visualizing Abstract Objects and Relations, World Scientific, Singapore, 1989.
13. T. Kamada, S. Kawai, An algorithm for drawing general undirected graphs. Inform. Process. Lett. 31 (1989) 7-15.
14. T. Kohonen, Self-Organization and Associative Memory, Springer, Berlin, 1989.
15. T. Kohonen, The self-organizing map, Proc. IEEE 78 (1990) 1464-1480.
16. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Stuttgart, 1990.
17. N. Quinn, M. Breur, A force directed component placement procedure for printed circuit boards, IEEE Trans. Circuits and Systems CAS-26 (1979) 377-388.
18. R. Tamassia, G. Battista, C. Battini, Automatic graph drawing and readability of diagrams, IEEE Trans. Syst. Man Cybern. 18 (1988) 61-79.
19. W.T. Tutte, How to draw a graph, Proc. London Math. Soc. 13 (1963) 743-768.
20. C.-X. Zhang, D.A. Mlynski, Mapping and hierarchical self-organizing neural networks for VLSI placement, IEEE Trans. Neur. Net. 8 (1997) 299-314.