Abstract
The problem of clustering in large dynamic distributed networks is considered. A weighted, dynamic graph is used to model the problem environment, and various ways of formulating the clustering problem to achieve different objectives are examined. A distributed algorithm is presented along with an analysis of its communication cost, and possible application area are identified.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - International Conference on Distributed Computing Systems |
| Publisher | IEEE |
| Pages | 613-620 |
| Number of pages | 8 |
| ISBN (Print) | 0818606975 |
| State | Published - 1986 |
Publication series
| Name | Proceedings - International Conference on Distributed Computing Systems |
|---|