Self-organizing maps for drawing large graphs

DOI10.1016/S0020-0190(98)00108-2zbMath1338.68212MaRDI QIDQ293353

Eric Bonabeau, Florian Hénaux

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001082?np=y

zbMATH Keywords

neural networksgraph drawingself-organizing mapsforce-directed algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Graph multidimensional scaling with self-organizing maps

Cites Work

• Self-organization and associative memory.
• Algorithms for drawing graphs: An annotated bibliography
• An algorithm for drawing general undirected graphs
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• A forced directed component placement procedure for printed circuit boards
• How to Draw a Graph
• Unnamed Item

This page was built for publication: Self-organizing maps for drawing large graphs