Connected-closeness: A Visual Quantification of Distances in Network Layouts

DOI10.7155/JGAA.00626MaRDI QIDQ6051912zbMATH OpenFDO

Authors

Publication date 20 September 2023

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.00626

zbMATH Keywords

layoutnetwork-visualization metric

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• Visualizing Large and Clustered Networks
• Graph Drawing
• Shape-Based Quality Metrics for Large Graph Visualization
• SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT

Cites work

• Algorithms for graph partitioning on the planted partition model
• An Experimental Study on Distance-Based Graph Drawing
• Collective dynamics of `small-world' networks
• Energy Models for Graph Clustering
• Graph Drawing
• Graph Drawing via Gradient Descent, (GD)^2
• scientific article; zbMATH DE number 1843070 (Why is no real title available?)
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Untangling the hairballs of multi-centered, small-world online social media networks

Cited in

(1)

• Graph Drawing

This page was built for publication: Connected-closeness: A Visual Quantification of Distances in Network Layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051912)