Jump to content

Fiduccia–Mattheyses algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Wilson SK Jin (talk | contribs) at 12:59, 25 March 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Fiduccia–Mattheyses_algorithm&oldid=420651808"