An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
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)
Constraint-Based Spring-Model Algorithm for Graph Layout
GD '95 Proceedings of the Symposium on Graph Drawing
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
GD '95 Proceedings of the Symposium on Graph Drawing
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)
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Drawing Directed Graphs Using Quadratic Programming
IEEE Transactions on Visualization and Computer Graphics
Nature-inspired visualisation of similarity and relationships in human systems and behaviours
Information Visualization - Special issue on visual analysis of human dynamics
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Hierarchically organized layout for visualization of biochemical pathways
Artificial Intelligence in Medicine
Stress majorization with orthogonal ordering constraints
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing directed graphs clockwise
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
Abstract- 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.