Fast layout computation of clustered networks: algorithmic advances and experimental analysis

DOI10.1016/j.ins.2013.09.048zbMath1347.68281OpenAlexW2055211963MaRDI QIDQ903597

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

zbMATH Keywords

hierarchical clusteringgraph drawingforce-directed algorithmnetwork visualizationmulti-scale algorithmtreemap algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A Distributed Multilevel Force-Directed Algorithm ⋮ ChordLink: a new hybrid visualization model

Cites Work

• Unnamed Item
• The level ancestor problem simplified
• Graph drawing software
• Empirical evaluation of aesthetics-based graph layout
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• From the Cover: The structure of scientific collaboration networks
• Fast Algorithms for Finding Nearest Common Ancestors
• The Structure and Function of Complex Networks
• Navigating Clustered Graphs Using Force-Directed Methods
• Graph Drawing and Applications for Software and Knowledge Engineers
• Community structure in social and biological networks
• The Star Clustering Algorithm for Static and Dynamic Information Organization
• Fast unfolding of communities in large networks
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Graph Drawing
• Drawing graphs. Methods and models

This page was built for publication: Fast layout computation of clustered networks: algorithmic advances and experimental analysis