Encyclopedia > Disperser

  Article Content


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
Wikipedia contains spoilers

... to discuss the plot of fictional works in their entirety. Many books and films, however, lose some of their dramatic impact if the details of the plot are known ...