Sciweavers

Share
JGAA
1998
116views more  JGAA 1998»
8 years 8 months ago
New Lower Bounds For Orthogonal Drawings
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...
Therese C. Biedl
JGAA
1998
70views more  JGAA 1998»
8 years 8 months ago
Algorithms for Cluster Busting in Anchored Graph Drawing
Kelly A. Lyons, Henk Meijer, David Rappaport
books