Skip to search formSkip to main contentSkip to account menu

Fiduccia-Mattheyses algorithm

Known as: FM algorithm 
A classical approach to solve the Hypergraph bipartitioning problem is an iterative heuristic by Fiduccia and Mattheyses. This heuristic is commonly… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The max-bisection problem consists in partitioning the vertices of a weighted undirected graph into two equally sized subsets so… 
2009
2009
In this paper, the relations among T-invariants, repetitive vectors and siphons are investigated and new methods for computing… 
Highly Cited
2007
Highly Cited
2007
Efficient path-planning algorithms are a crucial issue for modern autonomous underwater vehicles. Classical path-planning… 
Highly Cited
2004
Highly Cited
2004
The application of deregulation policies in electric power systems results in the absolute necessity to quantify power quality… 
2003
2003
The goal of data clustering can be formally stated as a min-max clustering principle: data points are grouped into clusters such… 
1999
1999
We discuss the implementation and evaluation of move-based hypergraph partitioning heuristics in the context of VLSI design… 
1999
1999
Abstract. In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are… 
Highly Cited
1997
Highly Cited
1997
  • L. Hagen, A. Kahng
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1997
  • Corpus ID: 15212750
VLSI netlist partitioning has been addressed chiefly by iterative methods (e.g. Kernighan-Lin and Fiduccia-Mattheyses) and… 
Highly Cited
1997
Highly Cited
1997
Hardware-software partitioning is one of the most important issues of codesign of embedded systems because it is made at the… 
1995
1995
In this paper, a Fiduccia-Mattheyses (FM) algorithm incorporating a novel initial partition generating method is proposed. The…