Sciweavers

GD
2006
Springer
14 years 3 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
GD
2006
Springer
14 years 3 months ago
Controllable and Progressive Edge Clustering for Large Networks
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...
Huamin Qu, Hong Zhou, Yingcai Wu
GD
2006
Springer
14 years 3 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
GD
2006
Springer
14 years 3 months ago
On the Crossing Number of Almost Planar Graphs
Petr Hlinený, Gelasio Salazar
GD
2006
Springer
14 years 3 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
GD
2006
Springer
14 years 3 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
GD
2006
Springer
14 years 3 months ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren
GD
2006
Springer
14 years 3 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
GD
2006
Springer
14 years 3 months ago
Trees with Convex Faces and Optimal Angles
Josiah Carlson, David Eppstein
GD
2006
Springer
14 years 3 months ago
Angle and Distance Constraints on Tree Drawings
Ulrik Brandes, Barbara Schlieper