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

Canadian Music Hall of Fame

... 1983 Glenn Gould 1986 Gordon Lightfoot 1987 The Guess Who[?] 1989 The Band 1990 Maureen Forrester[?] 1991 Leonard Cohen 1992 Ian and Sylvia[?] 1993 Anne ...