2017
DOI: 10.5626/ktcp.2017.23.3.156
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Algorithm for Measuring Graph Similarity Using CUDA on GPU

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…A similar approach is studied in Somkunwar and Vaze (2019) using the OpenMP. To find approaches closer to the work we developed in this study, making intensive use of different HPC techniques, multicore, multigpu, we must make a more intensive search, and then we can find works developed by Wang et al (2013) and the work of Son et al (2017), both are some of the few works that use data parallelism in the implementation of their algorithms.…”
Section: Isomorph and Graph Isomorphismmentioning
confidence: 99%
“…A similar approach is studied in Somkunwar and Vaze (2019) using the OpenMP. To find approaches closer to the work we developed in this study, making intensive use of different HPC techniques, multicore, multigpu, we must make a more intensive search, and then we can find works developed by Wang et al (2013) and the work of Son et al (2017), both are some of the few works that use data parallelism in the implementation of their algorithms.…”
Section: Isomorph and Graph Isomorphismmentioning
confidence: 99%