52 search results - page 1 / 11 » Crossing minimization in extended level drawings of graphs |
DAM
2010
13 years 5 months ago
2010
APVIS
2008
13 years 6 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
WALCOM
2010
IEEE
13 years 12 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
GD
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...