Paper Info
Title
Visualization of Large Graphs Using GPU Computing
Abstract
Graphs may be used to visualize relationships between objects. Relations are represented by edges and objects are called nodes. When graph is drawn, one can easily see and understand the basic structure of data. Many different applications can be found in social network analysis, computer networks, scientific literature analysis, etc. However drawing large graphs (thousands or a millions of nodes), is still challenging problem. There exist many different algorithms for drawing graphs. Each algorithm has specific behavior and different applications and limits. Some algorithms are focused on quality while others are more suitable for large graphs. This paper aims to speed up the computation using GPU, so larger graphs can be visualized in acceptable time, or visualization can be done even in real-time.
Year
DOI
Venue
2013
10.1109/INCoS.2013.126
Intelligent Networking and Collaborative Systems
Keywords
Field
DocType
basic structure,different algorithm,acceptable time,different application,gpu computing,large graphs,scientific literature analysis,challenging problem,computer network,larger graph,social network analysis,large graph,data visualisation
Graph drawing,Data visualization,Information visualization,Computer science,Visualization,Social network analysis,Theoretical computer science,General-purpose computing on graphics processing units,Graph (abstract data type),Speedup
Conference
Citations 
PageRank 
References 
5
0.43
8
Authors
4
Name
Order
Citations
PageRank
TomᚠJežowicz150.77
Miloš Kudelka2102.59
Jan Platos328658.72
Václav Snášel43710.63