The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm

In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorithm, which has empirically shown a signi cant improvement in the partitioning result compared to known algorithms.

• Type: Conference
• Year: 1994
• Where: ISCAS
• Authors: Achim G. Hoffmann
• Keywords: Dynamic Locking Algorithm, Great Importance, Hardware, Hypergraph Bipartitioning Problem, ISCAS 1994