Layered graph drawing or hierarchical graph drawing is a type of graph drawing in which the vertices of a directed graph are drawn in horizontal rowsâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Yosuke Onoue, Nobuyuki Kukimoto, Naohisa Sakamoto, Kazuo Misue, Koji Koyamada
- IEEE Computer Graphics and Applications
- 2017

An evaluation structure is a hierarchical structure of human cognition extracted from interviews based on the evaluation gridâ€¦Â (More)

Is this relevant?

2010

2010

- Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann
- Graph Drawing
- 2010

We show how to improve the Sugiyama scheme by using edge bundling. Our method modifies the layout produced by the Sugiyama schemeâ€¦Â (More)

Is this relevant?

2005

2005

- Seok-Hee Hong, Nikola S. Nikolov
- APVIS
- 2005

We introduce a new graph drawing convention for 3D layered drawings of directed graphs. The vertex set is partitioned into layersâ€¦Â (More)

Is this relevant?

2004

2004

- Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann
- J. Graph Algorithms Appl.
- 2004

Sugiyamaâ€™s algorithm for layered graph drawing is very popular and commonly used in practical software. The extensive use ofâ€¦Â (More)

Is this relevant?

2004

2004

- Matthew Suderman
- Int. J. Comput. Geometry Appl.
- 2004

An h-layer drawing of a graph G is a planar drawing of G in which each vertex is placed on one of h parallel lines and each edgeâ€¦Â (More)

Is this relevant?

2004

2004

- Ulrik Brandes, Tim Dwyer, Falk Schreiber
- J. Integrative Bioinformatics
- 2004

We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graphâ€¦Â (More)

Is this relevant?

2003

2003

- Ulrik Brandes, Tim Dwyer, Falk Schreiber
- Graph Drawing
- 2003

We propose a method for visualizing a set of related metabolic pathways using 2 2D graph drawing. Interdependent, twodimensionalâ€¦Â (More)

Is this relevant?

2002

2002

- Wilhelm Barth, Petra Mutzel, Michael JÃ¼nger
- J. Graph Algorithms Appl.
- 2002

We consider the problem of counting the interior edge crossings when a bipartite graph G = (V, E) with node set V and edge set Eâ€¦Â (More)

Is this relevant?

2001

2001

- Vida Dujmovic, Michael R. Fellows, +9 authors David R. Wood
- Algorithmica
- 2001

We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments betweenâ€¦Â (More)

Is this relevant?

2001

2001

- Irene Finocchi
- COCOON
- 2001

We study the problem of producing hierarchical drawings of layered graphs when some pairs of edges are not allowed to cross. Weâ€¦Â (More)

Is this relevant?