 | This article is rated Stub-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
I see in this article ( open-access version) that they define a Yao graph with k = 4, and that they define it as a directed graph (unlike the graph in the illustration which is undirected). Gabn1 ( talk) 07:20, 21 June 2020 (UTC)
...They also cite another paper that says that the Yao graph can be computed in O(n log n) time using O(n) space. Gabn1 ( talk) 07:22, 21 June 2020 (UTC)
|
| This article is rated Stub-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
I see in this article ( open-access version) that they define a Yao graph with k = 4, and that they define it as a directed graph (unlike the graph in the illustration which is undirected). Gabn1 ( talk) 07:20, 21 June 2020 (UTC)
...They also cite another paper that says that the Yao graph can be computed in O(n log n) time using O(n) space. Gabn1 ( talk) 07:22, 21 June 2020 (UTC)