19 search results - page 3 / 4 » Orthogonal Drawings of Series-Parallel Graphs with Minimum B... |
CCCG
2004
13 years 6 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
JGAA
1998
13 years 4 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
VLC
2002
13 years 4 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
ORDER
2006
13 years 4 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...