GD 2006 - PDF Preprint Papers

GD 2006 Graph Drawing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed GD-2006 Paper

click to vote

GD
2006
Springer

160views Computer Graphics» more GD 2006»

Eigensolver Methods for Progressive Multidimensional Scaling of Large Data

14 years 3 months ago

Download www.inf.uni-konstanz.de

We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....

Ulrik Brandes, Christian Pich

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	160	Eigensolver Methods for Progressive Multidimensional Scaling of Large Data	claim
2	125	Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor	claim
3	118	Computing Geometric Minimum-Dilation Graphs Is NP-Hard	claim
4	115	Upright-Quad Drawing of st -Planar Learning Spaces	claim
5	112	The Website for Graph Visualization Software References (GVSR)	claim
6	107	Integrating Edge Routing into Force-Directed Layout	claim
7	105	The Number of Triangulations on Planar Point Sets	claim
8	101	Angle and Distance Constraints on Tree Drawings	claim
9	99	Choosing Colors for Geometric Graphs Via Color Space Embeddings	claim
10	97	Controllable and Progressive Edge Clustering for Large Networks	claim
11	96	On the Crossing Number of Almost Planar Graphs	claim
12	95	Characterization of Unlabeled Level Planar Trees	claim
13	95	On the Decay of Crossing Numbers	claim
14	94	Simultaneous Graph Embedding with Bends and Circular Arcs	claim
15	94	Morphing Planar Graphs in Spherical Space	claim
16	91	Planarity Testing and Optimal Edge Insertion with Embedding Constraints	claim
17	90	Partitions of Graphs into Trees	claim
18	90	SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding	claim
19	83	Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings	claim
20	83	Improved Circular Layouts	claim
21	82	Schematisation of Tree Drawings	claim
22	78	Parameterized st -Orientations of Graphs: Algorithms and Experiments	claim
23	77	Straight-Line Drawing of Quadrangulations	claim
24	73	Trees with Convex Faces and Optimal Angles	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers