MGV: A system for visualizing massive multidigraphs

IEEE Transactions on Visualization and Computer Graphics

Volumn 8, Issue 1, 2002, Pages 21-38

  Abello, James ^a   Korn, Jeffrey ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

External memory; Graphs; Hierarchies; Massive data sets; Visualization

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION RETRIEVAL; INTERACTIVE COMPUTER SYSTEMS; JAVA PROGRAMMING LANGUAGE; SET THEORY; USER INTERFACES; VISUALIZATION;

DATA VISUALIZATION;

DATA STRUCTURES;

EID: 0036261475     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/2945.981849     Document Type: Article

References (46)

1. Exploring complex networks
2. Simple rules yield complex food webs
3. Molecular interaction map of the mammalian cell cycle control and DNA repair systems
4. From molecular to modular cell biology
5. Emerging properties of networks of biological signaling pathways
6. The large scale organization of metabolic networks
7. Graph structure in the web
8. On power-law relationships of the internet topology
9. The size of a giant component in a random graph with given degree sequence
10. Visualizing massive multi-digraphs
11. Graph sketches
12. The skewness of science
13. The structure of scientific collaboration networks
14. How popular is your paper? An empirical study of citation distribution
15. The significance of boards interlocks for corporate governance
16. On the evolution of random graphs
17. How not to lie with visualization
18. A rule-based tool for assisting colormap selection
19. Dynamic aggregation with circular visual designs
20. Circle segments: A technique for visually exploring large multidimensional data sets
21. Large scale network visualization
22. A functional approach to external memory graph algorithms
23. Navigating large networks with hierarchies
24. NicheWorks-interactive visualization of very large graphs
25. Navigating graph surfaces
26. External memory algorithms
27. Balanced aspect ratio trees and their use for drawing very large graphs
28. Multilevel visualization of clustered graphs
29. Straight-line drawing algorithms for hierarchical and clustered graphs
30. How to draw a planar clustered graph
31. Visualization of structural information: Automatic drawing of compound digraphs
32. A multidimensional approach to force directed layouts of large graphs
33. Hierarchical geometric models for visible surface algorithms
34. A delaunay-based method for surface approximation
35. Multiresolution modeling for fast rendering
36. Exploring large graphs in 3D hyperbolic space
37. Stealth terrain navigation
38. A linear time algorithm for network decomposition
39. Improved algorithms and data structures for solving graph problems in external memory