gSWORD: GPU-accelerated sampling for subgraph counting
Subgraph counting is a fundamental component for many downstream applications such as graph representation learning and query optimization. Since obtaining the exact count is often intractable, there have been a plethora of approximation methods on graph sampling techniques. Nonetheless, the state-o...
Saved in:
Main Authors: | YE, Chang, LI, Yuchen, SUN, Shixuan, GUO, Wentian |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9320 https://ink.library.smu.edu.sg/context/sis_research/article/10320/viewcontent/3639288_pvoa_cc_by.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
GPU-accelerated subgraph enumeration on partitioned graphs
by: GUO, Wentian, et al.
Published: (2020) -
Exploiting reuse for GPU subgraph enumeration
by: GUO, Wentiao, et al.
Published: (2022) -
APPLICATION OF MULTIVARIATE CENTRAL LIMIT THEOREM IN FINGERPRINT DISTRIBUTION AND CENTRED SUBGRAPH COUNT
by: LI SHANG
Published: (2023) -
Efficient sampling algorithms for approximate temporal motif counting
by: WANG, Jingjing, et al.
Published: (2020) -
PARALLEL GRAPH PROCESSING ON GPUS
by: GUO WENTIAN
Published: (2019)