An experimental study on the ply number of straight-line drawings
From MaRDI portal
(Redirected from Publication:4622771)
An experimental study on the ply number of straight-line drawings (scientific article; zbMATH DE number 7021730)
An experimental study on the ply number of straight-line drawings (scientific article; zbMATH DE number 7021730)
Recommendations
Cites work
- An algorithm for drawing general undirected graphs
- An Interactive Tool to Explore and Improve the Ply Number of Drawings
- Are crossings important for drawing large graphs?
- Emergence of Scaling in Random Networks
- Empirical evaluation of aesthetics-based graph layout
- Energy Models for Graph Clustering
- Graph Drawing
- Graph Drawing
- Graph drawing software
- GraphMaps: browsing large graphs as interactive maps
- Handbook of graph drawing and visualization
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Large-Graph Layout Algorithms at Work: An Experimental Study
- Low Ply Drawings of Trees
- Mining Graph Data
- On vertex- and empty-ply proximity drawings
- Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing
Cited in
(3)
This page was built for publication: An experimental study on the ply number of straight-line drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622771)