Sciweavers

431 search results - page 5 / 87
» Bold Graph Drawings
Sort
View
CCCG
2007
13 years 8 months ago
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area
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...
Fabrizio Frati
COMGEO
2007
ACM
13 years 7 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 5 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka
GD
2003
Springer
14 years 17 days ago
An Energy Model for Visual Graph Clustering
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
Andreas Noack
GD
2004
Springer
14 years 22 days ago
Really Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
Vida Dujmovic, Matthew Suderman, David R. Wood