Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,508,276 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
3 relations
Broader (1)
Electronic design automation
Graph partition
Kernighan–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
Geng Lin
,
Wen-xing Zhu
IEEE Transactions on Computers
2014
Corpus ID: 8133782
The max-bisection problem consists in partitioning the vertices of a weighted undirected graph into two equally sized subsets so…
Expand
2009
2009
Incidence Matrix Based Methods for Computing Repetitive Vectors and Siphons of Petri Net
Guanjun Liu
,
Changjun Jiang
J. Inf. Sci. Eng.
2009
Corpus ID: 7289930
In this paper, the relations among T-invariants, repetitive vectors and siphons are investigated and new methods for computing…
Expand
Highly Cited
2007
Highly Cited
2007
Path Planning for Autonomous Underwater Vehicles
C. Pêtrès
,
Y. Pailhas
,
P. Patrón
,
Y. Pétillot
,
Jonathan Evans
,
D. Lane
IEEE Transactions on Robotics
2007
Corpus ID: 7545831
Efficient path-planning algorithms are a crucial issue for modern autonomous underwater vehicles. Classical path-planning…
Expand
Highly Cited
2004
Highly Cited
2004
Disturbance classification utilizing dynamic time warping classifier
A. Youssef
,
T. Abdel-Galil
,
E. El-Saadany
,
M. Salama
IEEE Transactions on Power Delivery
2004
Corpus ID: 24792297
The application of deregulation policies in electric power systems results in the absolute necessity to quantify power quality…
Expand
2003
2003
A MinMaxCut Spectral Method for Data Clustering and Graph Partitioning
C. Ding
,
Xiaofeng He
,
H. Zha
,
Ming Gu
,
H. Simon
2003
Corpus ID: 6400731
The goal of data clustering can be formally stated as a min-max clustering principle: data points are grouped into clusters such…
Expand
1999
1999
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
A. Caldwell
,
A. Kahng
,
I. Markov
ALENEX
1999
Corpus ID: 2918146
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
Xiaoye Jiang
,
P. Mohapatra
Multimedia Systems
1999
Corpus ID: 20481416
Abstract. In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are…
Expand
Highly Cited
1997
Highly Cited
1997
Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning
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…
Expand
Highly Cited
1997
Highly Cited
1997
Functional partitioning for hardware-software codesign using genetic algorithms
J. Hidalgo
,
J. Lanchares
EUROMICRO 97. Proceedings of the 23rd EUROMICRO…
1997
Corpus ID: 17743239
Hardware-software partitioning is one of the most important issues of codesign of embedded systems because it is made at the…
Expand
1995
1995
A gradient method on the initial partition of Fiduccia-Mattheyses algorithm
Lung-Tien Liu
,
M. Kuo
,
Shih-Chen Huang
,
Chung-Kuan Cheng
Proceedings of IEEE International Conference on…
1995
Corpus ID: 5947353
In this paper, a Fiduccia-Mattheyses (FM) algorithm incorporating a novel initial partition generating method is proposed. The…
Expand
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