incubator-clerezza-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Reto Bachmann-Gmür (JIRA) <j...@apache.org>
Subject [jira] Created: (CLEREZZA-81) More efficient Graph Isomorphism
Date Wed, 20 Jan 2010 11:32:54 GMT
More efficient Graph Isomorphism
--------------------------------

                 Key: CLEREZZA-81
                 URL: https://issues.apache.org/jira/browse/CLEREZZA-81
             Project: Clerezza
          Issue Type: Improvement
            Reporter: Reto Bachmann-Gmür


The current GraphMatcher used in AbstarctGraph.equals is efficient when it can map all bnoded
of the two Garphs by computing hash on them. When the hashes can not be refined further it
simply tries all permutations with the bnodes with the same hash. In some situations this
latter brude force fallback is terribly inefficient. For example if the compared graphs contain
circles of bnodes connceted with the same property, in this and similar case we should switch
back to hash-code based matching after randomly equating just two node of the two graphs.

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.


Mime
View raw message