A classical approach to solve the Hypergraph bipartitioning problem is an iterative heuristic by Charles Fiduccia and Robert Mattheyses. This heuristic is commonly called the FM algorithm.
Introduction.
FM algorithm is a linear time heuristic for improving network partitions.
New features to K-L heuristic:
F–M heuristic: notation.
Input: A hypergraph with a vertex (cell) set and a hyperedge (net) set
Output: 2 partitions 
References.
 ;templatestyles src="Reflist/styles.css" / ;