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.
2014
2014
An Efficient Memetic Algorithm for theMax-Bisection Problem
The max-bisection problem consists in partitioning the vertices of a weighted undirected graph into two equally sized subsets so… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
2010
2010
Minimizing the power consumption of a Chip Multiprocessor under an average throughput constraint
In a multi-core system, power and performance may be dynamically traded off by utilizing power management (PM). This paper… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
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
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
2003
2003
Combining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
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
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
Highly Cited
1996
Highly Cited
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
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
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