109 search results - page 1 / 22 » Straight-Line Drawing Algorithms for Hierarchical Graphs and... |
ALGORITHMICA
2006
13 years 8 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
GD
1998
Springer
14 years 25 days ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
JDA
2010
13 years 7 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
ENDM
2008
13 years 8 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
CCCG
2007
13 years 10 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...