Layered graph drawing

Known as: Sugiyama scheme 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2016
01219992016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
An evaluation structure is a hierarchical structure of human cognition extracted from interviews based on the evaluation grid… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
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
We introduce a new graph drawing convention for 3D layered drawings of directed graphs. The vertex set is partitioned into layers… (More)
  • figure 1
  • figure 3
Is this relevant?
2004
2004
Sugiyama’s algorithm for layered graph drawing is very popular and commonly used in practical software. The extensive use of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2003
2003
We propose a method for visualizing a set of related metabolic pathways using 2 2D graph drawing. Interdependent, twodimensional… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2002
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2001
2001
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2001
2001
We study the problem of producing hierarchical drawings of layered graphs when some pairs of edges are not allowed to cross. We… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?