Sparse partitions

Baruch Awerbuch, David Peleg

Research output: Contribution to journalConference articlepeer-review

238 Scopus citations

Abstract

A collection of clustering and decomposition techniques that make possible the construction of sparse and locality-preserving representations for arbitrary networks is presented. The representation method considered is based on breaking the network G(V,E) into connected regions, or clusters, thus obtaining a cover for the network, i.e., a collection of clusters that covers the entire set of vertices V. Several other graph-theoretic structures that are strongly related to covers are discussed. These include sparse spanners, tree covers of graphs, and the concepts of regional matchings and diameter-based separators. All of these structures can be constructed by means of one of the clustering algorithms given here, and each has proved a convenient representation for handling certain network applications.

Original languageEnglish
Pages (from-to)503-513
Number of pages11
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
Volume2
StatePublished - 1990
Externally publishedYes
EventProceedings of the 31st Annual Symposium on Foundations of Computer Science - St. Louis, MO, USA
Duration: 22 Oct 199024 Oct 1990

Fingerprint

Dive into the research topics of 'Sparse partitions'. Together they form a unique fingerprint.

Cite this