Partitioning of VLSI fragments based on the model of glowworm's behavior

The paper deals with one of the most important VLSI design problem - partitioning of VLSI fragments. This problem belongs to the NP-hard problems class, and there are no accuracy method to solve it. The authors suggest a new heuristic approach based on the glowworm's behavior in nature. This method allows effectively to solve the problem of preliminary convergence by the use of probabilistic heuristics. A modified statement of the partitioning problem is made. The modification consists in simulation of circuit as a bigraph, where each vertices simulate either an element or a net, and each edges - as incidence relation between them. To carry out an computational experiments there were developed a software. As a result the authors have received an estimation of time complexity, represented by O(n2).