Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1556262.1556308acmconferencesArticle/Chapter ViewAbstractPublication PagesaviConference Proceedingsconference-collections
research-article

Navigating Giga-Graphs

Published: 22 May 2002 Publication History

Abstract

An effective way to process a graph that does not fit in RAM is to build a hierarchical partition of its set of vertices. This hierarchy induces a partition of the graph edge set. We use this partition to produce a macro view of the graph. A screen embedding of this macro view is a Graph Sketch. We describe the use of Rectangular FishEye Views to provide drill-down navigation of graph sketches at different levels of detail including the graph edges data. A higher level of detail of a sketch focus area is obtained by distorting the lower detail context. Alternative visual representations can be used at different sketch hierarchy levels. We provide two sketch screen embeddings. One is tree-map based and the other is obtained by a special sequence of graph edge contractions. We demonstrate the application of our current Unix/Windows prototype to telecommunication graphs with edge sets ranging from 100 million to 1 billion edges(Giga-Graphs). To our knowledge this is the first time that focus within context techniques have been used successfully for the navigation of external memory graphs.

References

[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řtrodově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.
[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.
[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

Cited By

View all
  • (2022)Understanding Missing Links in Bipartite Networks With MissBiNIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2020.303298428:6(2457-2469)Online publication date: 1-Jun-2022
  • (2021)Responsive Matrix Cells: A Focus+Context Approach for Exploring and Editing Multivariate GraphsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2020.303037127:2(1644-1654)Online publication date: Mar-2021
  • (2009)Visualizing Global Patterns in Huge DigraphsProceedings of the 2009 Third International Conference on Network and System Security10.1109/NSS.2009.37(480-483)Online publication date: 19-Oct-2009
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
AVI '02: Proceedings of the Working Conference on Advanced Visual Interfaces
May 2002
382 pages
ISBN:1581135378
DOI:10.1145/1556262
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 2002

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. external memory algorithms
  2. fisheye views
  3. graph sketches
  4. hierarchies
  5. massive data sets
  6. visualization

Qualifiers

  • Research-article

Conference

AVI'02
Sponsor:
AVI'02: Advanced Visual Interfaces
May 22 - 24, 2002
Trento, Italy

Acceptance Rates

Overall Acceptance Rate 128 of 490 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Understanding Missing Links in Bipartite Networks With MissBiNIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2020.303298428:6(2457-2469)Online publication date: 1-Jun-2022
  • (2021)Responsive Matrix Cells: A Focus+Context Approach for Exploring and Editing Multivariate GraphsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2020.303037127:2(1644-1654)Online publication date: Mar-2021
  • (2009)Visualizing Global Patterns in Huge DigraphsProceedings of the 2009 Third International Conference on Network and System Security10.1109/NSS.2009.37(480-483)Online publication date: 19-Oct-2009
  • (2006)Fisheye Tree Views and Lenses for Graph VisualizationProceedings of the conference on Information Visualization10.1109/IV.2006.54(17-24)Online publication date: 5-Jul-2006
  • (2005)Effectively Visualizing Large Networks Through SamplingVIS 05. IEEE Visualization, 2005.10.1109/VISUAL.2005.1532819(375-382)Online publication date: 2005
  • (2004)Matrix Zoom: A Visual Interface to Semi-External GraphsIEEE Symposium on Information Visualization10.1109/INFVIS.2004.46(183-190)Online publication date: 2004
  • (2004)Hierarchical graph mapsComputers & Graphics10.1016/j.cag.2004.03.01228:3(345-359)Online publication date: Jun-2004

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media