GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs

Yihua Wei; Peng Jiang

doi:10.1109/ipdps57955.2024.00097

ScienceGate Book Chapters

JOURNAL ARTICLE

GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs

Yihua Wei Peng Jiang

Year: 2024 Pages: 1046-1057

DOI: 10.1109/ipdps57955.2024.00097

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Parallel computing Matching (statistics) Induced subgraph isomorphism problem CUDA General-purpose computing on graphics processing units Graph Computer graphics (images) Theoretical computer science Mathematics Graphics Line graph

Metrics

Cited By

0.64

FWCI (Field Weighted Citation Impact)

Refs

0.66

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Neural Networks

Physical Sciences → Computer Science → Artificial Intelligence

Bioinformatics and Genomic Networks

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Graph Theory and Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs

Metrics

Citation History

Topics

Related Documents

VSGM: View-Based GPU-Accelerated Subgraph Matching on Large Graphs

Efficient GPU-Accelerated Subgraph Matching

GPU-Accelerated Batch-Dynamic Subgraph Matching

Multi-GPU Programming Model for Subgraph Matching in Large Graphs

GPU-Accelerated Subgraph Enumeration on Partitioned Graphs