See Fiduccia-Mattheyses algorithm on Wiktionary
{
"etymology_text": "Introduced in a 1982 paper by Fiduccia and Mattheyses.",
"forms": [
{
"form": "the Fiduccia-Mattheyses algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Fiduccia-Mattheyses algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [],
"source": "w"
}
],
"glosses": [
"An iterative heuristic algorithm for bipartitioning a hypergraph."
],
"id": "en-Fiduccia-Mattheyses_algorithm-en-name-fcOThiER",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"iterative",
"iterative"
],
[
"heuristic",
"heuristic"
],
[
"bipartition",
"bipartition"
],
[
"hypergraph",
"hypergraph"
]
],
"raw_glosses": [
"(computing theory) An iterative heuristic algorithm for bipartitioning a hypergraph."
],
"synonyms": [
{
"word": "FM algorithm"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Fiduccia-Mattheyses algorithm"
]
}
],
"word": "Fiduccia-Mattheyses algorithm"
}
{
"etymology_text": "Introduced in a 1982 paper by Fiduccia and Mattheyses.",
"forms": [
{
"form": "the Fiduccia-Mattheyses algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Fiduccia-Mattheyses algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"An iterative heuristic algorithm for bipartitioning a hypergraph."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"iterative",
"iterative"
],
[
"heuristic",
"heuristic"
],
[
"bipartition",
"bipartition"
],
[
"hypergraph",
"hypergraph"
]
],
"raw_glosses": [
"(computing theory) An iterative heuristic algorithm for bipartitioning a hypergraph."
],
"synonyms": [
{
"word": "FM algorithm"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Fiduccia-Mattheyses algorithm"
]
}
],
"word": "Fiduccia-Mattheyses algorithm"
}
Download raw JSONL data for Fiduccia-Mattheyses algorithm meaning in All languages combined (1.2kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-07-20 from the enwiktionary dump dated 2025-07-01 using wiktextract (45c4a21 and f1c2b61). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.