A Parallel Algorithm for Subgraph Isomorphism (Brief Announcement)

Yadav, Rohan; Acar, Umut A.

doi:10.1145/3323165.3323170

Cited by 1 publication

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We found (Carletti et al ., 2019), where authors parallelize their VF3 algorithm. Another approach to the parallelism of this class of algorithms can be found in the work of Yadav and Acar (2019), making use of the different cores. A similar approach is studied in Somkunwar and Vaze (2019) using the OpenMP.…”

Section: Related Workmentioning

confidence: 99%

ISOMORPH: an efficient application on GPU for detecting graph isomorphism

Llanes,

Imbernón Tudela,

Curado

et al. 2023

View full text Add to dashboard Cite

PurposeThe authors will review the main concepts of graphs, present the implemented algorithm, as well as explain the different techniques applied to the graph, to achieve an efficient execution of the algorithm, both in terms of the use of multiple cores that the authors have available today, and the use of massive data parallelism through the parallelization of the algorithm, bringing the graph closer to the execution through CUDA on GPUs.Design/methodology/approachIn this work, the authors approach the graphs isomorphism problem, approaching this problem from a point of view very little worked during all this time, the application of parallelism and the high-performance computing (HPC) techniques to the detection of isomorphism between graphs.FindingsResults obtained give compelling reasons to ensure that more in-depth studies on the HPC techniques should be applied in these fields, since gains of up to 722x speedup are achieved in the most favorable scenarios, maintaining an average performance speedup of 454x.Originality/valueThe paper is new and original.

show abstract

Section: Related Workmentioning

confidence: 99%