Self-Organizing Graphs
and
ISOM Layout

Self-Organizing Graphs are a new paradigm for graph layout. The method is based on a competitive learning strategy which is an extension of Kohonen's self-organizing maps. To our knowledge this is the first connectionist method for graph layout. If you want to learn how self-organizing graphs and the ISOM learning algorithm behind them work you can

Read the following papers
- Competitive Learning of Network Diagram Layout
- Self-Organizing Graphs: A Neural Network Perspective of Graph Layout.
Watch some pre-recorded simulations (AVI movies) of self-organizing graphs
- In 2-D (AVI movie, 4.9 MB)
- In 3-D (AVI movie, 280 KB)
- On spherical surfaces (AVI movie, 1.4 MB):
Experiment with the SOG/ISOM applet.
Mail to me (Bernd Meyer) if you have any questions.

Have fun and thanks for your interest!

updated 2/8/98 Bernd Meyer

Self-Organizing Graphs and ISOM Layout

Self-Organizing Graphs
and
ISOM Layout