Naming and Counting in Anonymous Unknown Dynamic Networks

DOI10.1007/978-3-319-03089-0_20zbMath1473.68125DBLPconf/sss/MichailCS13arXiv1208.0180OpenAlexW1915300733WikidataQ57607994 ScholiaQ57607994MaRDI QIDQ3191210

Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis

Publication date: 30 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.0180

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (11)

Distributed computation and reconfiguration in actively dynamic networks ⋮ Simple and fast approximate counting and leader election in populations ⋮ A Glimpse at Paul G. Spirakis ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ A faster exact-counting protocol for anonymous dynamic networks ⋮ Connectivity preserving network transformers ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: Naming and Counting in Anonymous Unknown Dynamic Networks