Fast layout computation of clustered networks: algorithmic advances and experimental analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Community structure in social and biological networks
- Drawing graphs. Methods and models
- Empirical evaluation of aesthetics-based graph layout
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast unfolding of communities in large networks
- Graph Drawing
- Graph Drawing and Applications for Software and Knowledge Engineers
- Graph drawing software
- Large-Graph Layout Algorithms at Work: An Experimental Study
- Navigating Clustered Graphs Using Force-Directed Methods
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- The Star Clustering Algorithm for Static and Dynamic Information Organization
- The Structure and Function of Complex Networks
- The level ancestor problem simplified
- The structure of scientific collaboration networks
Cited in
(9)- Visualizing a Large-Scale Structure of Production Network by N-Body Simulation
- A distributed multilevel force-directed algorithm
- Large graph visualization from a hierarchical node clustering
- SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT
- Community radius embedded in force-directed and radial tree hybrid layout algorithm
- ChordLink: a new hybrid visualization model
- LunarVis – Analytic Visualizations of Large Graphs
- Visualizing Large and Clustered Networks
- Connected-closeness: A Visual Quantification of Distances in Network Layouts
This page was built for publication: Fast layout computation of clustered networks: algorithmic advances and experimental analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903597)