Abstract
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.
Subject
Computational Theory and Mathematics,Computer Science Applications,General Engineering,Software
Reference32 articles.
1. Every planar map is four colorable;Bulletin of the American Mathematical Society,1976
2. Every planar map is four colorable. Part ii: reducibility;Illinois Journal of Mathematics,1977
3. Approximate graph isomorphism,2012
4. Graph isomorphism in quasipolynomial time,2016
5. A sociometric approach applied to the description of a social network in a personalized education school in bogotá;International Journal of Sociology of Education,2016