An approach to optimal partitioning of hypergraphs

Abstract

The problem of determining optimal partitions of hypergraphs (or, more simply of ordinary graphs), is relevant in several areas, such as computer aided design of printed boards, information retrieval and program paging. In many cases there exist optimal or near optimal partitions, subject to the constraint that each block is an LS set. Intuitively, an LS set is a subset of nodes of the given hypergraph, more strongly connected to each other that to the nodes in the complementary subset. This paper presents a polynomial-bounded procedure to determine all the LS sets in a given hypergraph.