Rapid calculation of compact poset - isomorphism - certificates

摘要

Two methods and systems for the rapid construction of poset - isomorphism - certificates are shown. posets (partially ordered quantities) comprise graph. The invented certificates are number sequences with the property that two posets are isomorphically if and only if their corresponding certificates coincide. The first method generates the (omikron, iota) - isomorphism - certificate which can be further compressed. The minimum phi - isomorphism - certificate can be constructed, in that node of the graphs in phi - ordered symmetry - cluster be divided and a topological phi - node - hierarchy is generated. Thus, symmetries can be fixed at a low cost in posets. In addition, the phi - node - order of precedence and a poset - isomorphism - certificate a pair of separate one-dimensional poset - encryption keys for the available. As a poset representative animal data objects which can be applied in an automated design, operational reliability and safety applications, bioinformatics, management of semistructured data and other fields of use in general be used, it is possible by use of the isomorphism - certificate with substantially reduced memory - and computation time is stored, is analyzed, and are extracted.