Memory and communication efficient algorithm for decentralized counting of nodes in networks.
Node counting on a graph is subject to some fundamental theoretical limitations, yet a solution to such problems is necessary in many applications of graph theory to real-world systems, such as collective robotics and distributed sensor networks. Thus several stochastic and naïve deterministic algor...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Public Library of Science (PLoS)
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/b588b1166feb4d3498d9280a7ad77f70 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|