feasible pair
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 1)

H-INDEX

0
(FIVE YEARS 0)

Author(s):  
YongBin OuYang

This note provides counterexamples to illustrate that Theorem 4 which is proposed by Cornejo, Lobo and Medina [M. E. Cornejo, D. Lobo, J. Medina, Bipolar fuzzy relation equations systems based on the product t-norm. Mathematical Methods in the Applied Sciences. 2019,42(17):5779-5793] is incorrect. The incorrect of Theorem 4 is due to the inaccuracy of the definition of feasible pair. Then we present the correction of the definition of feasible pair to the contention.


2014 ◽  
Vol 513-517 ◽  
pp. 483-486
Author(s):  
Long Yuan ◽  
Wei Xin Tian

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.


Sign in / Sign up

Export Citation Format

Share Document