Algorithms and Computation

DOI10.1007/11602613zbMath1173.68382OpenAlexW2304246803MaRDI QIDQ5897886

Christos Kaklamanis, Ioannis Caragiannis, Clemente Galdi

Publication date: 14 November 2006

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

Full work available at URL: https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (6)

The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Monitoring churn in wireless networks ⋮ Fast size approximation of a radio network in beeping model ⋮ Approximate Neighbor Counting in Radio Networks ⋮ Approximating the Size of a Radio Network in Beeping Model

This page was built for publication: Algorithms and Computation