Generalization of Two Hypergraphs. Algorithm of Calculation of the Greatest Sub-Hypergraph Commonto Two Hypergraphs Annotated by Semantic Information

摘要

The problem of the search of the greatest sub-hypergraph common to two hypergraph is a combina- tional search problem. The algorithm of exploration of all solutions has an exponential complexity according to the size of the tow hypergraphs. In this article, we present methods to minimize the neces- sary time for the calculation of these solutions. These methods constitute a general framework of the study of these problems and can be used in many areas such natural language, pattern recognition or organic chemistry.