This survey describes research directions in netlist partitioning during the past two decades
in terms of both problem formulations and solution approaches. We discuss the traditional …

A partitioning approach called ratio cut is proposed. The authors demonstrate that the ratio
cut algorithm can locate the clustering structures in the circuit. Finding the optimal ratio cut is …

Circuit partitioning for hierarchical VLSI design is addressed. A partitioning approach called
ratio cut is proposed. It is demonstrated that the ratio cut algorithm can locate the clustering …

A two-way partitioning algorithm is presented that significantly improves on the highly
unstable results typically obtained from the traditional Kernighan-Lin-based algorithms. The …

Modern mobile applications are benefiting significantly from the advancement in deep
learning, eg, implementing real-time image recognition and conversational system. Given a …

Combining global and local search is a strategy used by many successful hybrid
optimization approaches. Memetic Algorithms (MAs) are Evolutionary Algorithms (EAs) that …

This paper presents adiscussion of methods to solve multiple way partitioning problems
under three different objective functions. A multicommodity flow fzeatmertt is proposed for …

Bever 57 ABSTRACT A modified partitioning method for placement of a circuit design into a
programmable integrated circuit device (PICD), the PICD having a specific distribution of …

Partitioning is an important step in the top-down design of large complicated integrated
circuits. In this paper, a simple yet effective partitioning technique is described. It is based on …

Iterative-improvement two-way min-cut partitioning is an important phase in most circuit
placement tools, and finds use in many other computer-aided design (CAD) applications …