BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs
Ehsan Moradi, Debajyoti Mondal

TL;DR
BigGraphVis introduces a GPU-accelerated, streaming algorithm-based method for visualizing large graphs, enabling faster and meaningful community-based visualizations of graphs with millions of nodes and edges.
Contribution
It combines streaming community detection algorithms with GPU processing to efficiently visualize massive graphs, a novel approach in big graph visualization.
Findings
Achieved 70-95% speedup in visualization time.
Successfully visualized graphs with over 3 million nodes and 34 million edges.
Produced meaningful and reliable community-based visualizations.
Abstract
Graph layouts are key to exploring massive graphs. An enormous number of nodes and edges do not allow network analysis software to produce meaningful visualization of the pervasive networks. Long computation time, memory and display limitations encircle the software's ability to explore massive graphs. This paper introduces BigGraphVis, a new parallel graph visualization method that uses GPU parallel processing and community detection algorithm to visualize graph communities. We combine parallelized streaming community detection algorithm and probabilistic data structure to leverage parallel processing of Graphics Processing Unit (GPU). To the best of our knowledge, this is the first attempt to combine the power of streaming algorithms coupled with GPU computing to tackle big graph visualization challenges. Our method extracts community information in a few passes on the edge list, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Data Visualization and Analytics · Advanced Graph Neural Networks
