Fast layout computation of clustered networks: algorithmic advances and experimental analysis
DOI10.1016/J.INS.2013.09.048zbMATH Open1347.68281OpenAlexW2055211963MaRDI QIDQ903597FDOQ903597
Authors: Walter Didimo, Fabrizio Montecchiani
Publication date: 14 January 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.09.048
Recommendations
hierarchical clusteringgraph drawingforce-directed algorithmnetwork visualizationmulti-scale algorithmtreemap algorithm
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Graph drawing software
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Fast unfolding of communities in large networks
- The level ancestor problem simplified
- Title not available (Why is that?)
- Empirical evaluation of aesthetics-based graph layout
- Graph Drawing and Applications for Software and Knowledge Engineers
- Drawing graphs. Methods and models
- Fast Algorithms for Finding Nearest Common Ancestors
- The structure of scientific collaboration networks
- Navigating Clustered Graphs Using Force-Directed Methods
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Graph Drawing
- The Star Clustering Algorithm for Static and Dynamic Information Organization
- Large-Graph Layout Algorithms at Work: An Experimental Study
Cited In (7)
- ChordLink: a new hybrid visualization model
- Visualizing Large and Clustered Networks
- Connected-closeness: A Visual Quantification of Distances in Network Layouts
- A Distributed Multilevel Force-Directed Algorithm
- SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT
- LunarVis – Analytic Visualizations of Large Graphs
- Visualizing a Large-Scale Structure of Production Network by N-Body Simulation
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)