Fiduccia–Mattheyses algorithm: Difference between revisions
Content deleted Content added
| Line 2: | Line 2: | ||
==References== |
==References== |
||
* |
* Category:Electronic design automation: Laung-Terng Wang, Yao-Wen Chang, Kwang-Ting[TIM] Cheng |
||
[[ko:FM 알고리즘]] |
[[ko:FM 알고리즘]] |
||
Revision as of 13:14, 25 March 2011
A classical approach to solve the Hypergraph bipartitioning problem is an iterative heuristic by Fiduccia and Mattheyses [Fiduccia 1982]. This heuristic is commonly called the FM algorithm.
References
- Category:Electronic design automation: Laung-Terng Wang, Yao-Wen Chang, Kwang-Ting[TIM] Cheng