Drawing power law graphs

Authors:
Reid Andersen;Fan Chung;Lincoln Lu
Affiliations:
University of California, San Diego;University of California, San Diego;University of California, San Diego
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 1
Cited 4

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Visual Exploration of Complex Time-Varying Graphs

IEEE Transactions on Visualization and Computer Graphics
Visualizing large and clustered networks

GD'06 Proceedings of the 14th international conference on Graph drawing
Visualisation and analysis of large and complex scale-free networks

EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Manual clustering refinement using interaction with blobs

EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. Our methods are influenced by recent developments in the modeling of such graphs.