Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs: methods and models
Drawing graphs: methods and models
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A survey of graph layout problems
ACM Computing Surveys (CSUR)
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
| Hi-index | 0.00 |
We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can be applied without change to cyclic or acyclic digraphs, and even to graphs containing both directed and undirected edges. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.