See Yao graph on Wiktionary
{
"etymology_text": "Named after Andrew Yao.",
"forms": [
{
"form": "Yao graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Yao graph (plural Yao graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"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": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Shapes",
"orig": "en:Shapes",
"parents": [],
"source": "w"
}
],
"glosses": [
"A kind of geometric spanner, a weighted undirected graph connecting a set of geometric points with the property that, for every pair of points in the graph, their shortest path has a length that is within a constant factor of their Euclidean distance."
],
"id": "en-Yao_graph-en-noun-Ia4R10uF",
"links": [
[
"graph theory",
"graph theory"
],
[
"geometric",
"geometric"
],
[
"undirected",
"undirected"
],
[
"point",
"point"
],
[
"path",
"path"
],
[
"length",
"length"
],
[
"Euclidean distance",
"Euclidean distance"
]
],
"raw_glosses": [
"(graph theory) A kind of geometric spanner, a weighted undirected graph connecting a set of geometric points with the property that, for every pair of points in the graph, their shortest path has a length that is within a constant factor of their Euclidean distance."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "Yao graph"
}
{
"etymology_text": "Named after Andrew Yao.",
"forms": [
{
"form": "Yao graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Yao graph (plural Yao graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory",
"en:Shapes"
],
"glosses": [
"A kind of geometric spanner, a weighted undirected graph connecting a set of geometric points with the property that, for every pair of points in the graph, their shortest path has a length that is within a constant factor of their Euclidean distance."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"geometric",
"geometric"
],
[
"undirected",
"undirected"
],
[
"point",
"point"
],
[
"path",
"path"
],
[
"length",
"length"
],
[
"Euclidean distance",
"Euclidean distance"
]
],
"raw_glosses": [
"(graph theory) A kind of geometric spanner, a weighted undirected graph connecting a set of geometric points with the property that, for every pair of points in the graph, their shortest path has a length that is within a constant factor of their Euclidean distance."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "Yao graph"
}
Download raw JSONL data for Yao graph meaning in All languages combined (1.3kB)
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-05-13 from the enwiktionary dump dated 2025-05-01 using wiktextract (9a214a4 and 1b6da77). 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.