An algorithm for drawing general undirected graphs
Information Processing Letters
Optimal linear labelings and eigenvalues of graphs
Discrete Applied Mathematics
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs to convey proximity: an incremental arrangement method
ACM Transactions on Computer-Human Interaction (TOCHI)
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)
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium 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
Combining Hierarchy and Energy Drawing Directed Graphs
IEEE Transactions on Visualization and Computer Graphics
A two-way visualization method for clustered data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
| Hi-index | 0.00 |
In this paper we discuss a useful family of graph drawing algorithms, characterized by their ability to draw graphs in one dimension. We define the special requirements from such algorithms and show how several graph drawing techniques can be extended to handle this task. In particular, we suggest a novel optimization algorithm that facilitates using the Kamada and Kawai model [Inform. Process. Lett. 31 (1989) 7-15] for producing one-dimensional layouts. The most important application of the algorithms seems to be in achieving graph drawing by axis separation, where each axis of the drawing addresses different aspects of aesthetics.