Graph Drawing by Force-directed Placement Export

@article{citeulike:761193, abstract = {We present a modification of the spring-embedder model of Eades [ Congresses Numerantium, 42, 149-160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually-intuitive, nd efficient algorithm.}, author = {Fruchterman, T. M. J. and Reingold, E. M.}, citeulike-article-id = {761193}, editor = {John}, journal = {Software: Practice and Experience}, keywords = {algorithm, force-directed\_placement, graph, graph\_drawing, multi-level\_techniques, network, pajek, simulated\_annealing, social\_network}, month = {November}, pages = {1129--1164}, posted-at = {2006-07-16 15:13:47}, priority = {2}, title = {Graph Drawing by Force-directed Placement}, volume = {21}, year = {1991} }

TY - JOUR ID - citeulike:761193 L3 - citeulike-article-id:761193 N2 - We present a modification of the spring-embedder model of Eades [ Congresses Numerantium, 42, 149-160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually-intuitive, nd efficient algorithm. JF - Software: Practice and Experience EP - 1164 TI - Graph Drawing by Force-directed Placement VL - 21 SP - 1129 KW - algorithm KW - force-directed_placement KW - graph KW - graph_drawing KW - multi-level_techniques KW - network KW - pajek KW - simulated_annealing KW - social_network AU - Fruchterman, TMJ AU - Reingold, EM A2 - John PY - 1991/11// ER -