Fiduccia–Mattheyses algorithm: Difference between revisions
Content deleted Content added
←Created page with 'A classical approach to solve the hypergrph bipartitioning problem is an iterative heuristic by Fiduccia and Mattheyses [Fiduccia 1982]. This heuristic is commo...' |
No edit summary |
||
| Line 4: | Line 4: | ||
{{reflist}} |
{{reflist}} |
||
[[Category:Electronic design automation]] |
[[Category:Electronic design automation]] |
||
[[kr:FM 알고리즘]] |
[[kr:FM 알고리즘]] |
||
Revision as of 12:57, 25 March 2011
A classical approach to solve the hypergrph bipartitioning problem is an iterative heuristic by Fiduccia and Mattheyses [Fiduccia 1982]. This heuristic is commonly called the FM algorithm.