Fiduccia-Mattheyses algorithm（FM算法）

Fiduccia-Mattheyses algorithm

1.简介

以下是维基百科的原文简介：

FM algorithm is a linear time heuristic for improving network partitions. New features to  K-L heuristic :

• Aims at reducing net-cut costs; the concept of cutsize is extended to hypergraphs.
• Only a single vertex is moved across the cut in a single move.
• Vertices are weighted.
• Can handle "unbalanced" partitions; a balance factor is introduced.
• A special data structure is used to select vertices to be moved across the cut to improve running time.
• Time complexity O(P), where P is the total # of terminals

FM算法是一种改进网络分区的线性时间启发式算法，旨在减少不同分区之间的连接数，也就是分区之间的沟通成本，这种概念可以拓展到超图模型，

这个算法的主要目的是解决超图的双分区问题。

2.例子

以下通过一个例子来说明FM算法的基本原理：

在以下电路上执行FM算法

对电路进行超图建模：