An Approximation Algorithm for the Two-Layered Graph Drawing Problem

1999 ◽  
pp. 81-91 ◽  
Author(s):  
Atsuko Yamaguchi ◽  
Akihiro Sugimoto
Keyword(s):  
Approximation Algorithm ◽  
Graph Drawing ◽  
Layered Graph

On the Parameterized Complexity of Layered Graph Drawing

Algorithmica ◽  
2007 ◽  
Vol 52 (2) ◽  
pp. 267-292 ◽  
Author(s):  
Vida Dujmović ◽  
Michael R. Fellows ◽  
Matthew Kitching ◽  
Giuseppe Liotta ◽  
Catherine McCartin ◽  
...  
Keyword(s):  
Parameterized Complexity ◽  
Graph Drawing ◽  
Layered Graph

scholarly journals Edge Label Placement in Layered Graph Drawing

2018 ◽  
pp. 71-78 ◽  
Author(s):  
Christoph Daniel Schulze ◽  
Nis Wechselberg ◽  
Reinhard von Hanxleden
Keyword(s):  
Graph Drawing ◽  
Edge Label ◽  
Label Placement ◽  
Layered Graph

On the Parameterized Complexity of Layered Graph Drawing

2001 ◽  
pp. 488-499 ◽  
Author(s):  
V. Dujmović ◽  
M. Fellows ◽  
M. Hallett ◽  
M. Kitching ◽  
G. Liotta ◽  
...  
Keyword(s):  
Parameterized Complexity ◽  
Graph Drawing ◽  
Layered Graph

scholarly journals An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

2005 ◽  
Vol 9 (3) ◽  
pp. 305-325 ◽  
Author(s):  
Markus Eiglsperger ◽  
Martin Siebenhaller ◽  
Michael Kaufmann
Keyword(s):  
Graph Drawing ◽  
Efficient Implementation ◽  
Layered Graph

Automatic Layout of UML Class Diagrams in Orthogonal Style

2004 ◽  
Vol 3 (3) ◽  
pp. 189-208 ◽  
Author(s):  
Markus Eiglsperger ◽  
Carsten Gutwenger ◽  
Michael Kaufmann ◽  
Joachim Kupke ◽  
Michael Jünger ◽  
...  
Keyword(s):  
Graph Drawing ◽  
Structural Information ◽  
Software Systems ◽  
Modelling Language ◽  
Automatic Layout ◽  
Special Challenge ◽  
Class Diagrams ◽  
Inheritance Hierarchy ◽  
Shape Metrics ◽  
Layered Graph

Unified modelling language (UML) diagrams have become increasingly important in engineering and re-engineering processes for software systems. Of particular interest are UML class diagrams whose purpose is to display generalizations, associations, aggregations, and compositions in one picture. The combination of directed and undirected relations poses a special challenge to a graph layout tool. Current approaches for the automatic layout of class diagrams are based on the layered graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, that is, diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We suggest to use the topology-shape—metrics paradigm for automatic layout of class diagrams, which has been used very successfully for drawing undirected graphs in orthogonal style. Moreover, we introduce the algorithms UML-Kandinsky and GoVisual fitting into this paradigm. Both algorithms work for class diagrams with rich structural information as well as for class diagrams with few or no structural information. Therefore, they improve the existing algorithms significantly.

scholarly journals An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing

2005 ◽  
pp. 155-166 ◽  
Author(s):  
Markus Eiglsperger ◽  
Martin Siebenhaller ◽  
Michael Kaufmann
Keyword(s):  
Graph Drawing ◽  
Efficient Implementation ◽  
Layered Graph

scholarly journals Visual Understanding of Metabolic Pathways Across Organisms Using Layout in Two and a Half Dimensions

2004 ◽  
Vol 1 (1) ◽  
pp. 11-26 ◽  
Author(s):  
Ulrik Brandes ◽  
Tim Dwyer ◽  
Falk Schreiber
Keyword(s):  
Metabolic Pathways ◽  
Graph Drawing ◽  
Graph Visualization ◽  
Stacking Order ◽  
Full Picture ◽  
Visual Understanding ◽  
Layered Graph ◽  
Dimensional Graph

Summary We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph visualization. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full picture of subtle and significant differences among the pathways. The (dis)similarities between pathways are expressed by the Hamming distances of the underlying graphs which are used to compute a stacking order for the pathways. Layouts are determined by a global layout of the union of all pathway graphs using a variant of the proven Sugiyama approach for layered graph drawing. Our variant layout approach allows edges to cross if they appear in different graphs.

Layered Graph Drawing for Visualizing Evaluation Structures

2017 ◽  
Vol 37 (2) ◽  
pp. 20-30 ◽  
Author(s):  
Yosuke Onoue ◽  
Nobuyuki Kukimoto ◽  
Naohisa Sakamoto ◽  
Kazuo Misue ◽  
Koji Koyamada
Keyword(s):  
Graph Drawing ◽  
Layered Graph
Sign in / Sign up

Export Citation Format

Share Document