An introduction to temporal graphs: An algorithmic perspective
O Michail - Internet Mathematics, 2016 - Taylor & Francis
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
Brief announcement: efficient computation in congested anonymous dynamic networks
GA Di Luna, G Viglietta - Proceedings of the 2023 ACM Symposium on …, 2023 - dl.acm.org
An anonymous dynamic network is a network of indistinguishable processes whose
communication links may appear or disappear unpredictably over time. Previous research …
communication links may appear or disappear unpredictably over time. Previous research …
An introduction to temporal graphs: An algorithmic perspective
O Michail - … , Probability, Networks, and Games: Scientific Papers …, 2015 - Springer
A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …
discrete and only the relationships between the participating entities may change and not …
Computing in anonymous dynamic networks is linear
GA Di Luna, G Viglietta - 2022 IEEE 63rd Annual Symposium …, 2022 - ieeexplore.ieee.org
We give the first linear-time counting algorithm for processes in anonymous 1-interval-
connected dynamic networks with a leader. As a byproduct, we are able to compute in 3n …
connected dynamic networks with a leader. As a byproduct, we are able to compute in 3n …
Optimal computation in leaderless and multi-leader disconnected anonymous dynamic networks
GA Di Luna, G Viglietta - arXiv preprint arXiv:2207.08061, 2022 - arxiv.org
We give a simple characterization of which functions can be computed deterministically by
anonymous processes in dynamic networks, depending on the number of leaders in the …
anonymous processes in dynamic networks, depending on the number of leaders in the …
Space-optimal counting in population protocols
J Beauquier, J Burman, S Claviere, D Sohier - International Symposium on …, 2015 - Springer
In this paper, we study the fundamental problem of counting, which consists in computing
the size of a system. We consider the distributed communication model of population …
the size of a system. We consider the distributed communication model of population …
Time and space optimal counting in population protocols
J Aspnes, J Beauquier, J Burman, D Sohier - arXiv preprint arXiv …, 2016 - arxiv.org
This work concerns the general issue of combined optimality in terms of time and space
complexity. In this context, we study the problem of (exact) counting resource-limited and …
complexity. In this context, we study the problem of (exact) counting resource-limited and …
Supervised average consensus in anonymous dynamic networks
DR Kowalski, MA Mosteiro - Proceedings of the 33rd ACM Symposium …, 2021 - dl.acm.org
How to reach consensus on an average value in a dynamic crowd without revealing
identity? In this work, we study the problem of Average Network Consensus in Anonymous …
identity? In this work, we study the problem of Average Network Consensus in Anonymous …
Counting in anonymous dynamic networks under worst-case adversary
In this paper we investigate the problem of counting the size of a network where processes
are anonymous (ie, they share the same identifier) and the network topology constantly …
are anonymous (ie, they share the same identifier) and the network topology constantly …
Conscious and unconscious counting on anonymous dynamic networks
This paper addresses the problem of counting the size of a network where (i) processes
have the same identifiers (anonymous nodes) and (ii) the network topology constantly …
have the same identifiers (anonymous nodes) and (ii) the network topology constantly …