Navigating Giga-Graphs

Proceedings of the Workshop on Advanced Visual Interfaces AVI

Volumn , Issue , 2002, Pages 290-299

  Abello, James ^a   Korn, Jeffrey ^a   Kreuseler, Matthias ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

external memory algorithms; fisheye views; graph sketches; hierarchies; massive data sets; visualization

Indexed keywords

EXTERNAL MEMORY ALGORITHMS; FISHEYE VIEWS; GRAPH SKETCHES; HIERARCHIES; MASSIVE DATA SETS;

FLOW VISUALIZATION; GRAPHIC METHODS; RANDOM ACCESS STORAGE;

TREES (MATHEMATICS);

EID: 2542478855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1556262.1556308     Document Type: Conference Paper

References (18)

1. B. Shneiderman. Information Visualization: Dynamic queries, starfield displays, and LifeLines. In www.cs.umd.edu, 1997.
2. O. Borůvka. O Jistém Problému Minimální m In Práce Moravské Přírodovédecké Společnosti v Brně (Acta Societ. Science. Natur. Moravicae, Vol. 3, pp.37-58, 1926.
3. A. Broder Graph Structure in the Web. In Networks, Vol. 33, pages 309-320, 2000.
4. M. Faloutsos, P. Faloutsos, C. Faloutsos. On power-law relationships of the Internet topology. In Comp. Comm. Rev., Vol. 29, pages 251-262, 1999.
5. J. Abello, I. Finocchi, J. Korn. Graph Sketches. In IEEE Proc. Information Visualization, pages 67-71, San Diego, Ca, 2001.
6. J. Abello, J. Korn. Visualizing Massive Multi-Digraphs. In IEEE Proc. Information Visualization, pages 39-47, Salk Lake City, 2000.
7. J. Abello, J. Korn. MGV: A System to Visualize Massive Multi-Digraphs. In IEEE Transactions on Computer Graphics and Visualization, Vol. 8, No. 1, pages 21-38, Jan. 2002.
8. U. Rauschenbach, S. Jeschke, H. Schumann. General Rectangular FishEye Views for 2D Graphics. In Proc. Intelligent Interactive Assistance and Mobile Computing, IMC. 2000.
9. J. Abello, A. Buchsbaum, and J. Westbrook. A functional approach to external memory graph algorithms. In European Symposium on Algorithms, volume 1461 of Lecture Notes in Computer Science, pages 332-343. Springer-Verlag, 1998.
10. J. Abello, S. Krishnan. Navigating Graph Surfaces. In Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P. Pardalos(Ed.), pages 1-16. Kluwer Academic Publishers, 1999.
11. J. Abello, J. Vitter. (Eds) External Memory Algorithms. Volume 50 of the AMS-DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 1999.
12. C. Duncan, M. Goodrich, S. Kobourov. Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. Lecture Notes in Computer Science, 1547:111-124, 1998.
13. P. Eades, Q. W. Feng. Multilevel Visualization of Clustered Graphs. Lecture Notes in Computer Science, 1190:101-112, 1997. (Pubitemid 127024204)
14. P. Eades, Q. W. Feng, X. Lin. Straight-line drawing algorithms for hierarchical and clustered graphs. In Proc. 4th Symp. on Graph Drawing, pages 113-128, 1996.
15. K. Sugiyama, K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. In IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No 4, pages 876-892, 1991. (Pubitemid 23616561)
16. D. Harel, Y. Koren. A fast multi-scale method for drawing large graphs. TR MCS99-21, The Weizmann Institute of Science, Rehovot, Israel, 1999.
17. P. Gajer, M. Goodrich, S. Kobourov. A multidimensional approach to force directed layouts of large graphs. In Proc. of Graph Drawing, Lecture Notes of Computer Science, Springer Verlag, 2000.
18. QT. http://www.trolltech.com