Sciweavers

GD
1999
Springer
14 years 4 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
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 ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
GD
1999
Springer
14 years 4 months ago
Drawing Planar Graphs with Circular Arcs
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...
C. C. Cheng, Christian A. Duncan, Michael T. Goodr...
GD
1999
Springer
14 years 4 months ago
Centrality in Policy Network Drawings
—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...
Ulrik Brandes, Patrick Kenis, Dorothea Wagner
GD
1999
Springer
14 years 4 months ago
Partitioning Approach to Visualization of Large Graphs
Vladimir Batagelj, Andrej Mrvar, Matjaz Zaversnik
GD
1999
Springer
14 years 4 months ago
Isomorphic Subgraphs
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...
Sabine Bachl
GD
1999
Springer
14 years 4 months ago
Visibility Representations of Complete Graphs
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...
Robert Babilon, Helena Nyklová, Ondrej Pang...