See cutwidth in All languages combined, or Wiktionary
Download JSON data for cutwidth meaning in English (1.6kB)
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "cut",
"3": "width"
},
"expansion": "cut + width",
"name": "compound"
}
],
"etymology_text": "cut + width",
"forms": [
{
"form": "cutwidths",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "cutwidth (plural cutwidths)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph."
],
"id": "en-cutwidth-en-noun-MWIVWtVs",
"links": [
[
"graph theory",
"graph theory"
],
[
"minimum",
"minimum"
],
[
"edge",
"edge"
],
[
"cross",
"cross"
],
[
"cut",
"cut"
],
[
"vertices",
"vertex"
],
[
"optimal",
"optimal"
],
[
"linear",
"linear"
],
[
"arrangement",
"arrangement"
],
[
"graph",
"graph"
]
],
"raw_glosses": [
"(graph theory) The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph."
],
"related": [
{
"word": "pathwidth"
}
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "cutwidth"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "cut",
"3": "width"
},
"expansion": "cut + width",
"name": "compound"
}
],
"etymology_text": "cut + width",
"forms": [
{
"form": "cutwidths",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "cutwidth (plural cutwidths)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "pathwidth"
}
],
"senses": [
{
"categories": [
"English compound terms",
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"en:Graph theory"
],
"glosses": [
"The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"minimum",
"minimum"
],
[
"edge",
"edge"
],
[
"cross",
"cross"
],
[
"cut",
"cut"
],
[
"vertices",
"vertex"
],
[
"optimal",
"optimal"
],
[
"linear",
"linear"
],
[
"arrangement",
"arrangement"
],
[
"graph",
"graph"
]
],
"raw_glosses": [
"(graph theory) The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "cutwidth"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-20 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). 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.