SuperGraph Visualization

  title={SuperGraph Visualization},
  author={Jos{\'e} Fernando Rodrigues and Agma J. M. Traina and Christos Faloutsos and Caetano Traina},
  journal={Eighth IEEE International Symposium on Multimedia (ISM'06)},
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle large graphs with hundred thousand nodes and possibly million edges. Such graphs bring two challenges: interactive visualization demands prohibitive processing power and, even if we could interactively update the visualization, the user would be overwhelmed by the excessive number of graphical items. To cope with this… Expand
Large Graph Analysis in the GMine System
The visual environment of GMine is instantiated as a system in which large graphs can be investigated globally and locally, and deals with the problem of tracing the connection aspects of a graph hierarchy with sub linear complexity. Expand
GViewer: GPU-Accelerated Graph Visualization and Mining
In these experiments, the CPU-based solution takes more than half one hours on the CPU to layout a graph with 14.5 thousand vertexes, where N is the number of vertexes in the graph. Expand
Graph Aggregation : Application to Social Networks
New measures to evaluate the quality of summaries based on an existing algorithm named k-SNAP that produces a summarized graph according to user-selected node attributes and relationships are proposed. Expand
Visual Statistics for Collections of Clustered Graphs
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks, as well as forExpand
Interactive Graph Summarization
This chapter introduces database-style operations to summarize graphs, and describes the methods described, which provide an analogous functionality for large graph data sets. Expand
GMINESYS: Efficient approach to reduce storage area using LZW compression
This work presents a system that explores two new ideas to address scalability in large graph visualization, one to represent large graph using Gmine system and then second to reduce the storage area required to store the huge data. Expand
Efficient aggregation for graph summarization
This paper introduces two database-style operations to summarize graphs, called SNAP and k-SNAP, that allow users to control the resolutions of summaries and provides the "drill-down" and "roll-up" abilities to navigate through summaries with different resolutions. Expand
Querying graph databases
A graph querying toolkit built on top of a commodity RDBMS that provides the support of various sophisticated graph query operations besides the simple ones like node/edge selection and path search, and introduces an aggregation method that produces summary graphs. Expand
Soft and Adaptive Aggregation of Heterogeneous Graphs with Heterogeneous Attributes
A new soft and adaptive approach to aggregate heterogeneous graphs i.e., composed of different node attributes and different relationship types using the definition of Rough Set Theory RST combined with Formal Concept Analysis FCA, the well known K-Medoids and the hierarchical clustering methods is developed. Expand
A Study to Handle Dynamic Graph Partitioning
The proposed work will analyze the large dynamic graph by partitioning it, and the system will update graph when multiple nodes and edges will be inserted or deleted at runtime. Expand


Multilevel Visualization of Clustered Graphs
This paper describes some two dimensional plane drawing algorithms for clustered graphs and shows how to extend these algorithms to three dimensional multilevel drawings, and considers two conventions: straight-line convex drawings and orthogonal rectangular drawings. Expand
Navigating hierarchically clustered networks through fisheye and full-zoom methods
Many information structures are represented as two-dimensional networks (connected graphs) of links and nodes. Because these network tend to be large and quite complex, people often perfer to viewExpand
Exploring Large Graphs in 3D Hyperbolic Space
  • T. Munzner
  • Computer Science
  • IEEE Computer Graphics and Applications
  • 1998
A software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation is described and the applicability of this system to goals beyond simple exploration is discussed. Expand
Multilevel Graph Partitioning Schemes
A new coarsening heuristic is presented (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of the sizes of the final partition obtained after multilevel refinement. Expand
Efficient and Practical Algorithms for Sequential Modular Decomposition
A practical algorithm with an O(n+m?(m,n) time bound and a variant with a linear time bound is given and a unique decomposition of the vertices into nested modules is described. Expand
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
An enhancement of the Kernighan--Lin partition optimization algorithm which incorporates load-balancing is presented and the resulting algorithm is tested against a different but related state-of-the-art partitioner and shown to provide improved results. Expand
Drawing graphs using modular decomposition
Proceedings of the IEEE International Symposium on Multimedia
  • Proceedings of the IEEE International Symposium on Multimedia
  • 2006
Dynamic Drawing of Clustered Graphs
This paper presents an algorithm for drawing a sequence of graphs that contain an inherent grouping of their vertex set into clusters, and introduces several metrics for measuring layout quality of dynamic clustered graphs. Expand
Drawing Clustered Graphs on an Orthogonal Grid