On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-size graphs, yield self-similar patterns when launched on huge graphs. To prove this, we consider the problem of assessing the self-similarity of graph drawings, and measure the box-counting dimension of the output of three algorithms, each using a different approach for producing orthogonal grid drawings with a reduced number of bends.