Software—Practice & Experience
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Aesthetic layout of generalized trees
Software—Practice & Experience
Graph layout for applications in compiler construction
Theoretical Computer Science
Graphlet: design and implementation of a graph editor
Software—Practice & Experience - Special issue on discrete algorithm engineering
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
What is a Good Diagram? A Pragmatic Approach
Proceedings of the Fourth International Conference on Entity-Relationship Approach
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings
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
Online Hierarchical Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Visualization aided performance tuning of irregular task-parallel computations
Information Visualization
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Hierarchically organized layout for visualization of biochemical pathways
Artificial Intelligence in Medicine
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarchies, or database schemas can be modelled by graphs and represented visually using graph drawing algorithms. Most existing graph drawing algorithms do not consider the size of nodes when creating a drawing. In most real world applications, however, nodes contain information which has to be displayed and nodes thus need a specific area to display this information. The required area can vary significantly between different nodes in the same graph. In this paper we present an algorithm for the layering step of hierarchical graph drawing methods that is able to take the sizes of the nodes into account. It further allows the user to choose between compact drawings with many temporary (dummy) nodes and less compact drawings with fewer dummy nodes. A large number of dummy nodes can significantly increase the running time of the subsequent steps of hierarchical graph drawing methods.