
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
James Abello, Jeffrey Korn, "MGV: A System for Visualizing Massive Multidigraphs," IEEE Transactions on Visualization and Computer Graphics, vol. 8, no. 1, pp. 2138, JanuaryMarch, 2002.  
BibTex  x  
@article{ 10.1109/2945.981849, author = {James Abello and Jeffrey Korn}, title = {MGV: A System for Visualizing Massive Multidigraphs}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {8}, number = {1}, issn = {10772626}, year = {2002}, pages = {2138}, doi = {http://doi.ieeecomputersociety.org/10.1109/2945.981849}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  MGV: A System for Visualizing Massive Multidigraphs IS  1 SN  10772626 SP21 EP38 EPD  2138 A1  James Abello, A1  Jeffrey Korn, PY  2002 KW  External memory KW  visualization KW  massive data sets KW  graphs KW  hierarchies. VL  8 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—We describe
[1] B. Shneiderman, “Information Visualization: Dynamic Queries, Starfield Displays, and LifeLines,” www.cs.umd.edu, 1997.
[2] S. Strogatz, “Exploring Complex Networks,” Nature, vol. 410, no. 8, pp. 268276, Mar. 2001.
[3] J. Cohen, F. Briand, and C. Newman, Community Food Webs: Data and Theory. Berlin: SpringerVerlag, 1990.
[4] J. Williams and N. Martinez, “Simple Rules Yield Complex Food Webs,” Nature, vol. 404, pp. 180183, 2000.
[5] K. Kohn, “Molecular Interaction Map of the Mammalian Cell Cycle Control and DNA Repair Systems,” Molecular Biology Cell, vol. 10, pp. 27032734, 1999.
[6] L. Hartwell, J. Hopfield, S. Leibler, and A. Murray, “From Molecular to Modular Cell Biology,” Nature, vol. 402, pp. C47C52, 1999.
[7] U. Bhalla and R. Iyengar, “Emerging Properties of Networks of Biological Signaling Pathways,” Science, vol. 283, pp. 381387, 1999.
[8] H. Jeong, B. Tombor, R. Albert, Z. Oltavi, and A. Barabasi, “The Large Scale Organization of Metabolic Networks,” Nature, vol. 407, pp. 651654, 2000.
[9] A. Broder et al., "Graph Structure in the Web," Proc. 9th Int'l WWW Conf. (WWW9), Elsevier, 2000, pp. 309320.
[10] M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On PowerLaw Relationships of the Internet Topology," Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM), ACM Press, New York, 1999, pp. 251262.
[11] M. Molloy and B. Reed, “The Size of a Giant Component in a Random Graph with Given Degree Sequence,” Combinatorics, Probability and Computing, vol. 7, pp. 295305, 1998.
[12] J. Abello and J. Korn, “Visualizing Massive MultiDigraphs,” IEEE Information Visualization Proc. Oct. 2000.
[13] J. Abello, I. Finocchi, and J. Korn, “Graph Sketches,” Proc. IEEE Information Visualization, 2001.
[14] P. Seglen, “The Skewness of Science,” J. Am. Soc. Information Science, vol. 43, pp. 628638, 1992.
[15] T. Achacoso and W. Yamamoto, AY's Neuroanatomy of C. Elegans for Computation. Boca Raton, Fla.: CRC Press, 1992.
[16] M. Newman, “The Structure of Scientific Collaboration Networks,” Proc. Nat'l Academy of Science USA, vol. 98, pp. 404409, 2001.
[17] S. Redner, “How Popular Is Your Paper? An Empirical Study of Citation Distribution,” European J. Physics B, vol. 4, pp. 131134, 1998.
[18] G. Davis, “The Significance of Boards Interlocks for Corporate Governance,” Corporate Governance, vol. 4, pp. 154159, 1996.
[19] E. Wilson, Consilience. New York: K nopf, 1998.
[20] P. Erdos and E. Renyi, “On the Evolution of Random Graphs,” Publications Math. Inst. of the Hungarian Academy of Science, vol. 5, pp. 1761, 1960.
[21] S. Strogatz, Nonlinear Dynamics and Chaos. New York: Perseus, 1994.
[22] M. Jacomet and W. Guggenbuhl, "LayoutDependent Fault Analysis and Test Synthesis for CMOS Circuits," IEEE Trans. ComputerAided Design of Integrated Circuits, vol. 12, no. 6, June 1993, pp. 888898.
[23] B. Rogowitz and L. Treinish, “A RuleBased Tool for Assisting Colormap Selection,” Visualization '95 Proc., vol. 444, pp. 118125, Oct. 1995.
[24] M. Chuah, “Dynamic Aggregation with Circular Visual Designs,” Proc. IEEE Symp. Information Visualization, pp. 3543, 1998.
[25] M. Ankerst, D. Keim, and H. Kriegel, “Circle Segments: A Technique for Visually Exploring Large Multidimensional Data Sets,” Proc. IEEE Conf. Visualization, 1996.
[26] J. Abello, E. Gansner, E. Koutsofios, and S. North, “Large Scale Network Visualization,” SIGGRAPH Newsletter, vol. 33, no 3, pp. 1315, Aug. 1999.
[27] J. Abello, A. Buchsbaum, and J. Westbrook, “A Functional Approach to External Memory Graph Algorithms,” Proc. European Symp. Algorithms, pp. 332343, 1998.
[28] S. Eick and G.J. Wills, “Navigating Large Networks with Hierarchies,” Proc. Visualization '93, pp. 204210, 1993.
[29] G.J. Wills, "Nicheworks—Interactive Visualization of Very Large Graphs," Proc. Graph Drawing 97, Lecture Notes in Computer Science, SpringerVerlag, Berlin, 1997.
[30] J. Abello and S. Krishnan, “Navigating Graph Surfaces,” Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P. Pardalos, ed., pp. 116, Kluwer Academic, 1999.
[31] External Memory Algorithms. vol. 50,AMSDIMACS Series on Discrete Math. and Theoretical Computer Science, J. Abello and J. Vitter, eds., 1999.
[32] C. Duncan, M. Goodrich, and S. Kobourov, “Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs,” Lecture Notes in Computer Science, vol. 1547, pp. 111124, 1998.
[33] P. Eades and Q.W. Feng, “Multilevel Visualization of Clustered Graphs,” Proc. Graph Drawing '96, pp. 101112, 1996.
[34] P. Eades, Q.W. Feng, and X. Lin, “StraightLine Drawing Algorithms for Hierarchical and Clustered Graphs,” Proc. Fourth Symp. Graph Drawing, pp. 113128, 1996.
[35] Q. Feng, R. Cohen, and P. Eades, “How to Draw a Planar Clustered Graph,” Proc. First Conf. Computers and Combinatorics, COCOON, pp. 2131, 1995.
[36] K. Sugiyama and K. Misue, “Visualization of Structural Information: Automatic Drawing of Compound Digraphs,” IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 4, pp. 876892, 1991.
[37] D. Harel and Y. Koren, “A Fast Multiscale Method for Drawing Large Graphs,” TR MCS9921, The Weizmann Inst. of Science, Rehovot, Israel, 1999.
[38] P. Gajer, M. Goodrich, and S. Kobourov, “A Multidimensional Approach to Force Directed Layouts of Large Graphs,” Proc. Graph Drawing, 2000.
[39] J. Clark, "Hierarchical Geometric Models for Visible Surface Algorithms," Comm. ACM, vol. 19, no. 10, pp. 547554, 1976.
[40] L. De Floriani, B. Falcidieno, and C. Pienovi, “A DelaunayBased Method for Surface Approximation,” Proc. Eurographics '83, pp. 333350, 1983.
[41] P. Heckbert and M. Garland, “Multiresolution Modeling for Fast Rendering,” Proc. Graphics Interface '94, pp. 4350, May 1994.
[42] T. Munzner, Exploring Large Graphs in 3D Hyperbolic Space IEEE Computer Graphics and Applications, vol. 18, no. 4, pp. 1823, July/Aug. 1998.
[43] Y. Teng, D. DeMenthon, and L.S. Davis, “Stealth Terrain Navigation,” IEEE Trans. Systems, Man, and Cybernetics, vol. 23, no. 1, pp. 96110, 1993.
[44] D. Karabeg, “Parallel Algorithm Graph Reduction,” TR No. CS88120, Univ. of California, San Diego, Mar. 1988.
[45] L. Cowen, A Linear Time Algorithm for Network Decomposition. Dimacs TR Series, no. 9456, Dec. 1994.
[46] V. Kumar and E.J. Schwabe, “Improved Algorithms and Data Structures for Solving Graph Problems in External Memory,” Proc. Eighth IEEE Symp. Parallel and Distributed Processing (SPDP), pp. 169176, 1996.