Encyclopedia > Disperser

Article Content

Disperser

An (N,M,D,K,e)-disperser is a bipartite graph with N nodes on the left side, each with degree D, and M nodes on the right side, such that every subset of K nodes on the left side is connected to more than (1-e) fraction of the nodes on the right (i.e. more than (1-e)M nodes).

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Battle Creek, Michigan

... and the movie of the same name. As of the 2000 census, the city had a total population of 53,364. Geography According to the United States Census Bureau, the ...