Efficient graph comparison and visualization using GPU

Wojciech Czech, David A. Yuen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

This paper presents application of several graph algorithms for comparison and visualization of real-world networks. In order to obtain interactive and robust framework for analysis of large graphs we use CUDA implementations of all-shortest-paths (APSP) and breadth-first-search (BFS) algorithms along with CULA matrix decomposition routines. Such an approach allows for efficient computation of graph feature vectors, visualization with graph B-matrices and accelerating dimensionality reduction methods used to embed graphs into low-dimensional metric spaces. Graph analysis algorithms implemented in CUDA were integrated with Graph Investigator Java application via Java Native Interface (JNI) what makes them more convenient to use. We further present two real-world usage scenarios i.e. analysis and visualization of vascular networks in presence of tumor and clusterization based on graph representations of satelite photos.

Original languageEnglish (US)
Title of host publicationProc. - 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011 and 11th Int. Symp.on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011 and 10th IEEE Int. Conf. IUCC 2011
Pages561-566
Number of pages6
DOIs
StatePublished - Nov 23 2011
Event14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous Computing and Communications, IUCC 2011 - Dalian, Liaoning, China
Duration: Aug 24 2011Aug 26 2011

Publication series

NameProc. - 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011 and 11th Int. Symp. on Pervasive Systems, Algorithms, and Networks, I-SPA 2011 and 10th IEEE Int. Conf. on IUCC 2011

Other

Other14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous Computing and Communications, IUCC 2011
CountryChina
CityDalian, Liaoning
Period8/24/118/26/11

Keywords

  • all-shortest paths
  • graph B-matrix
  • graph comparison
  • graph descriptor

Fingerprint Dive into the research topics of 'Efficient graph comparison and visualization using GPU'. Together they form a unique fingerprint.

  • Cite this

    Czech, W., & Yuen, D. A. (2011). Efficient graph comparison and visualization using GPU. In Proc. - 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011 and 11th Int. Symp.on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011 and 10th IEEE Int. Conf. IUCC 2011 (pp. 561-566). [6062931] (Proc. - 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011 and 11th Int. Symp. on Pervasive Systems, Algorithms, and Networks, I-SPA 2011 and 10th IEEE Int. Conf. on IUCC 2011). https://doi.org/10.1109/CSE.2011.100