514 search results - page 27 / 103 » Drawing a Graph in a Hypercube |
GD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
GD
1998
Springer
15 years 1 months ago
1998
Springer
This report proposes a
88
Voted
WG
2010
Springer
14 years 8 months ago
2010
Springer
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...
GD
1997
Springer
15 years 1 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...
CCCG
2009
14 years 10 months ago
2009
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...