Visualizing large graphs
From MaRDI portal
Publication:6604447
Cites work
- scientific article; zbMATH DE number 2084283 (Why is no real title available?)
- scientific article; zbMATH DE number 46317 (Why is no real title available?)
- A Fast Multi-Scale Method for Drawing Large Graphs
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- A Multilevel Approach to the Travelling Salesman Problem
- A multi-scale algorithm for drawing graphs nicely
- A multilevel algorithm for wavefront reduction
- A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
- An r-Dimensional Quadratic Placement Algorithm
- An Experimental Study on Distance-Based Graph Drawing
- An algorithm for drawing general undirected graphs
- An experimental evaluation of multilevel layout methods
- An open graph visualization system and its applications to software engineering
- COAST: A Convex Optimization Approach to Stress-Based Embedding
- Clustering large graphs via the singular value decomposition
- Collective dynamics of `small-world' networks
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Discussion of a set of points in terms of their mutual distances.
- Drawing graphs using modular decomposition
- Dunnart: A Constraint-Based Network Diagram Authoring Tool
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
- Graph Drawing
- Graph Drawing
- Graph Drawing
- Graph Drawing by High-Dimensional Embedding
- How to Draw a Graph
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Multidimensional scaling. I: Theory and method
- Multilevel algorithms for linear ordering problems
- Multilevel refinement for combinatorial optimisation problems
- The University of Florida sparse matrix collection
This page was built for publication: Visualizing large graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604447)
