Sciweavers

Share
ISCAS
1994
IEEE

The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm

8 years 7 months ago
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.
Achim G. Hoffmann
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1994
Where ISCAS
Authors Achim G. Hoffmann
Comments (0)
books