| Article ID: | iaor20052279 |
| Country: | Belarus |
| Volume: | 48 |
| Issue: | 5 |
| Start Page Number: | 31 |
| End Page Number: | 34 |
| Publication Date: | Sep 2004 |
| Journal: | Doklady of the National Academy of Sciences of Belarus |
| Authors: | Lepin V.V. |
The problem of finding minimum cuts in hypergraphs with the side constraint that the vertex sets inducing these cuts must be of a given cardinality is considered. The polynomial time algorithm to find the sizes of the smallest cuts in a recursively constructed hypergraph is given.