Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,784,776 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
(opens in a new tab)
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.
2013
2013
An Efficient Memetic Algorithm for theMax-Bisection Problem
Geng Lin
,
Wen-xing Zhu
IEEE transactions on computers
2013
Corpus ID: 8133782
The max-bisection problem consists in partitioning the vertices of a weighted undirected graph into two equally sized subsets so…
Expand
2010
2010
Variations in FM algorithm for effective circuit partitioning
Subha Subramaniam
,
H. Mande
International Conference & Workshop on Emerging…
2010
Corpus ID: 20029443
In this paper, we describe the FM algorithm for partitioning a graph/hypergraph. We implement the algorithm for ISPD98 standard…
Expand
2010
2010
A bargaining approach to power control in networks of autonomous wireless entities
Vaggelis G. Douros
,
George C. Polyzos
,
S. Toumpis
ACM International Workshop on Mobility Management…
2010
Corpus ID: 10388892
Interference is a fundamental problem in wireless networks, even in sparse topologies. Power Control (PC) is a powerful tool for…
Expand
2009
2009
Instant Advertising in Mobile Peer-to-Peer Networks
Zaiben Chen
,
Heng Tao Shen
,
Quanqing Xu
,
Xiaofang Zhou
IEEE International Conference on Data Engineering
2009
Corpus ID: 16320508
To explore the benefit of advertising instant and location-aware commercials that can not be effectively promoted by traditional…
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
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
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
International Conference on Computer Aided Design
1995
Corpus ID: 5947353
In this paper, a Fiduccia-Mattheyses (FM) algorithm incorporating a novel initial partition generating method is proposed. The…
Expand
1995
1995
Fast Gradient Based Off-Line Training of Multilayer Perceptrons
S. McLoone
,
G. Irwin
1995
Corpus ID: 56494519
Fast off-line training of Multilayer Perceptrons (MLPs) using gradient based algorithms is discussed. Simple Back Propagation and…
Expand
1993
1993
Post-analysis-based clustering dramatically improves the Fiduccia-Mattheyses algorithm
Y. Saab
Proceedings of EURO-DAC 93 and EURO-VHDL 93…
1993
Corpus ID: 33500102
This paper describes a new partitioning algorithm, BISECT, which is an extension of the Fiduccia-Mattheyses (FM) algorithm that…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required