Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

3 relations

Broader (1)

Electronic design automation
Graph partitionKernighan–Lin algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Incidence Matrix Based Methods for Computing Repetitive Vectors and Siphons of Petri Net
In this paper, the relations among T-invariants, repetitive vectors and siphons are investigated and new methods for computing… Expand
  • figure 1
  • figure 3
  • figure 5
  • table 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Path Planning for Autonomous Underwater Vehicles
Efficient path-planning algorithms are a crucial issue for modern autonomous underwater vehicles. Classical path-planning… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
2006
2006
Modulation Domain Features for Discriminating Infrared Targets and Backgrounds
For the first time, we compute modulation domain features for infrared targets and backgrounds, including dominant modulations… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Disturbance classification utilizing dynamic time warping classifier
The application of deregulation policies in electric power systems results in the absolute necessity to quantify power quality… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2002
2002
The Finite Element Method for Computing the Stationary Distribution of an SRBM in a Hypercube with Applications to Finite Buffer Queueing Networks
This paper proposes an algorithm, referred to as BNAfm (Brownian network analyzer with finite element method), for computing the… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
1999
1999
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
We discuss the implementation and evaluation of move-based hypergraph partitioning heuristics in the context of VLSI design… Expand
Is this relevant?
1999
1999
Efficient admission control algorithms for multimedia servers
Abstract. In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Functional partitioning for hardware-software codesign using genetic algorithms
Hardware-software partitioning is one of the most important issues of codesign of embedded systems because it is made at the… Expand
  • figure 1
  • figure 2
  • table 2
  • table 3
  • figure 3
Is this relevant?
1996
1996
A probability-based approach to VLSI circuit partitioning
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative… Expand
  • figure 1
  • table 1
  • table 3
  • table 2
  • table 4
Is this relevant?
1995
1995
A gradient method on the initial partition of Fiduccia-Mattheyses algorithm
In this paper, a Fiduccia-Mattheyses (FM) algorithm incorporating a novel initial partition generating method is proposed. The… Expand
  • table 1
  • table 3
  • table 4
  • table 2
  • table 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE