Efficient calculation of aestheticy metrics of a graph

MaRDI QIDQ3450098zbMATH OpenFDO

Authors S. N. Pupyrev

Publication date 2 November 2015

zbMATH Keywords

graph drawing aesthetic metrics

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorics on words (68R15)

Recommendations

• Shape-based quality metrics for large graph visualization
• Shape-Based Quality Metrics for Large Graph Visualization
• A multi-scale algorithm for drawing graphs nicely
• Drawing graphs by eigenvectors: theory and practice
• On spectral graph drawing

Cited in

(3)

• Aesthetic discrimination of graph layouts
• A quality metric for visualization of clusters in graphs
• Shape-based quality metrics for large graph visualization

This page was built for publication: Efficient calculation of aestheticy metrics of a graph

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