Fast layout computation of clustered networks: algorithmic advances and experimental analysis
type: Item
instance of: scholarly article
title: Fast layout computation of clustered networks: algorithmic advances and experimental analysis
zbMATH Open document ID: 1347.68281
author: Walter Didimo
author: Fabrizio Montecchiani
published in: Information Sciences
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6530441
zbMATH Keywords: graph drawing
zbMATH Keywords: network visualization
zbMATH Keywords: hierarchical clustering
zbMATH Keywords: multi-scale algorithm
zbMATH Keywords: force-directed algorithm
zbMATH Keywords: treemap algorithm
MaRDI profile type: Publication
full work available at URL: j.ins.2013.09.048
OpenAlex ID: W2055211963
cites work: The Star Clustering Algorithm for Static and Dynamic Information Organization
cites work: The level ancestor problem simplified
cites work: Fast unfolding of communities in large networks
cites work: Q3154375
cites work: Straight-line drawing algorithms for hierarchical graphs and clustered graphs
cites work: Navigating Clustered Graphs Using Force-Directed Methods
cites work: Community structure in social and biological networks
cites work: Graph Drawing
cites work: Large-Graph Layout Algorithms at Work: An Experimental Study
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Graph drawing software
cites work: Drawing graphs. Methods and models
cites work: The structure of scientific collaboration networks
cites work: The Structure and Function of Complex Networks
cites work: Empirical evaluation of aesthetics-based graph layout
cites work: Graph Drawing and Applications for Software and Knowledge Engineers
DOI: 10.1016/J.INS.2013.09.048
description: scientific article; zbMATH DE number 6530441