Graph drawing by force-directed placement
Software—Practice & Experience
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
GD '95 Proceedings of the Symposium on Graph Drawing
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Drawing Clustered Graphs on an Orthogonal Grid
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Using spring algorithms to remove node overlapping
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Drawing graphs with non-uniform vertices
Proceedings of the Working Conference on Advanced Visual Interfaces
| Hi-index | 0.00 |
In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges, in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings are computed. In order to achieve aesthetically pleasing results, we use grid and circular placement techniques, and utilize an appropriate modification of a well-known spring embedder algorithm. It turns out, that for some classes of graphs, our algorithm runs in O(n+m) time, while in general, the running time is bounded in terms of the processing time of the spring embedder algorithm. The result is a drawing that reveals the structure of the graph G and preserves certain aesthetic criteria.