Patents

Determination of Combinations on Multipartite Hypergraphs

The software is used to solve a complex problem in graph theory, which consists in finding all combinations in a given hypergraph. With the help of the dynamic programming apparatus, an exhaustive procedure for constructing all possible combinations on a hypergraph is implemented. The software comprises the following modules: module for reading information about the hypergraph – the number of vertices, edges, and the order of partites. The format of this information is a text file in which the parameters of given hypergraph are indicated; module that implements the algorithm for finding combinations in a hypergraph. The software provides output of the software operation results in a text file. The algorithm determines all combinations of a hypergraph that contains no more than 100 edges, which for practical purposes is of a certain interest.

S.I.Salpagarov M.Tyartin A.Pankratov