942 search results - page 7 / 189 » Constraints in Graph Drawing Algorithms |
110
click to vote
IV
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
GD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
84
Voted
CCCG
2007
15 years 1 months ago
2007
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...
108
Voted
CCCG
1998
15 years 1 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
GD
2003
Springer
15 years 4 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...