Cargando…

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Saha, Arindam, Marshall, James A. R., Reina, Andreagiovanni
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8608303/
https://www.ncbi.nlm.nih.gov/pubmed/34807921
http://dx.doi.org/10.1371/journal.pone.0259736