Visualizing large graphs

DOI10.1002/WICS.1343zbMATH Open1545.62074MaRDI QIDQ6604447FDOQ6604447

Authors: Yifan Hu, Lei Shi 

Publication date: 12 September 2024

Published in: Wiley Interdisciplinary Reviews. WIREs Computational Statistics (Search for Journal in Brave)

zbMATH Keywords

high-dimensional datagraph embeddinggraph drawing

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites Work

• Dunnart: A Constraint-Based Network Diagram Authoring Tool
• The University of Florida sparse matrix collection
• An open graph visualization system and its applications to software engineering
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Multidimensional scaling. I: Theory and method
• Collective dynamics of `small-world' networks
• Clustering large graphs via the singular value decomposition
• An algorithm for drawing general undirected graphs
• How to Draw a Graph
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Title not available (Why is that?)
• An r-Dimensional Quadratic Placement Algorithm
• A Multilevel Approach to the Travelling Salesman Problem
• Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
• Graph Drawing
• A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
• A multilevel algorithm for wavefront reduction
• Multilevel refinement for combinatorial optimisation problems
• Multilevel algorithms for linear ordering problems
• Graph Drawing by High-Dimensional Embedding
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• A Fast Multi-Scale Method for Drawing Large Graphs
• Graph Drawing
• An Experimental Study on Distance-Based Graph Drawing
• A multi-scale algorithm for drawing graphs nicely
• An experimental evaluation of multilevel layout methods
• COAST: A Convex Optimization Approach to Stress-Based Embedding
• Graph Drawing
• Title not available (Why is that?)
• Drawing graphs using modular decomposition
• Discussion of a set of points in terms of their mutual distances.

Cited In (1)

• Jet: multilevel graph partitioning on graphics processing units

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)