Local algorithm: Difference between revisions
Content deleted Content added
m Normalize {{Multiple issues}}: Remove {{Issues}} for only 1 maintenance template: One source |
Adding short description: "Type of distributed algorithm" |
||
| Line 1: | Line 1: | ||
{{Short description|Type of distributed algorithm}} |
|||
{{One source|date=May 2023}} |
{{One source|date=May 2023}} |
||
A '''local algorithm''' is a distributed [[algorithm]] that runs in [[constant time]], independently of the size of the network.<ref>{{cite journal|last=Suomela|first=Jukka|title=Survey of Local Algorithms|journal=ACM Computing Surveys|year=2013|doi=10.1145/2431211.2431223|volume=45|issue=2|pages=1–40|citeseerx=10.1.1.216.1473|s2cid=6588866}}</ref> |
A '''local algorithm''' is a distributed [[algorithm]] that runs in [[constant time]], independently of the size of the network.<ref>{{cite journal|last=Suomela|first=Jukka|title=Survey of Local Algorithms|journal=ACM Computing Surveys|year=2013|doi=10.1145/2431211.2431223|volume=45|issue=2|pages=1–40|citeseerx=10.1.1.216.1473|s2cid=6588866}}</ref> |
||
Revision as of 23:31, 14 September 2024
 | This article relies largely or entirely on a single source. (May 2023) |
A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network.[1]
References
- ^ Suomela, Jukka (2013). "Survey of Local Algorithms". ACM Computing Surveys. 45 (2): 1–40. CiteSeerX 10.1.1.216.1473. doi:10.1145/2431211.2431223. S2CID 6588866.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |