GD
1999
Springer
13 years 8 months ago
1999
Springer
GD
1999
Springer
13 years 8 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
GD
1999
Springer
13 years 8 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
GD
1999
Springer
13 years 8 months ago
1999
Springer
—We introduce a network visualization technique that supports an analytical method applied in the social sciences. Policy network analysis is an approach to study policy making s...
GD
1999
Springer
13 years 8 months ago
1999
Springer
GD
1999
Springer
13 years 8 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
GD
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...