6 search results - page 1 / 2 » Balanced Aspect Ratio Trees and Their Use for Drawing Very L... |
GD
1998
Springer
13 years 9 months 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...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...