Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ISCAS
1994
IEEE

favoriteEmaildiscussreport

93views Hardware» more ISCAS 1994»

The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm

13 years 8 months ago

The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm

Download reference.kfupm.edu.sa

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

Real-time Traffic

Dynamic Locking Algorithm | Great Importance | Hardware | Hypergraph Bipartitioning Problem | ISCAS 1994 |

claim paper

Related Content

» Circuit Bipartitioning Using Genetic Algorithm

» PartitionBased Decision Heuristics for Image Computation Using SAT and BDDs

» Parallelizing postplacement timing optimization

» Multilevel kway Partitioning Scheme for Irregular Graphs

» Multilevel Graph Partitioning Schemes

» A new approach to parallelising tracing algorithms

» A Multiagent Algorithm for Graph Partitioning

» MSP algorithm multirobot patrolling based on territory allocation using balanced graph par...

» Optimising Graph Partitions Using Parallel Evolution

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	ISCAS
Authors	Achim G. Hoffmann

Comments (0)