52 search results - page 2 / 11 » Crossing minimization in extended level drawings of graphs |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
GD
2009
Springer
14 years 1 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
SOFSEM
2005
Springer
14 years 1 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
GD
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...