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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The max-bisection problem consists in partitioning the vertices of a weighted undirected graph into two equally sized subsets so… 
2010
2010
In this paper, we describe the FM algorithm for partitioning a graph/hypergraph. We implement the algorithm for ISPD98 standard… 
2009
2009
To explore the benefit of advertising instant and location-aware commercials that can not be effectively promoted by traditional… 
2008
2008
Power minimization is one of the very important issues in the testing of power constrained VLSI circuit. While existing… 
2002
2002
We propose a fast map (FM) algorithm, which has significant advantages for knowledge discovery applications due to its low… 
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
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… 
1995
1995
Fast off-line training of Multilayer Perceptrons (MLPs) using gradient based algorithms is discussed. Simple Back Propagation and… 
1993
1993
  • Y. Saab
  • 1993
  • Corpus ID: 33500102
This paper describes a new partitioning algorithm, BISECT, which is an extension of the Fiduccia-Mattheyses (FM) algorithm that…