Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory. The experiment shows that it has the better performance than current algorithm as the edges increase.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.