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. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Carmel, L., Harel, D., & Koren, Y. (2002). Drawing directed graphs using one-dimensional optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 193–206). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_19
Mendeley helps you to discover research relevant for your work.