Stably Computable Properties of Network Graphs

@inproceedings{Angluin2005StablyCP,
  title={Stably Computable Properties of Network Graphs},
  author={Dana Angluin and James Aspnes and Melody Chan and Michael J. Fischer and Hong Jiang and Ren{\'e} Peralta},
  booktitle={DCOSS},
  year={2005}
}
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what properties of the network graph can be stably computed by the devices. We show that they can detect whether the network has degree bounded by a constant d, and, if so, organize a computation that achieves asymptotically optimal linear memory use. We define a model of stabilizing inputs to such devices and show that a… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

Similar Papers

Loading similar papers…