131 search results - page 9 / 27 » Orthogonal thickness of graphs |
GD
2000
Springer
13 years 11 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
GD
1997
Springer
13 years 11 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
COCOON
2004
Springer
14 years 23 days ago
2004
Springer
GD
2001
Springer
13 years 12 months ago
2001
Springer