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
East Farmingdale, New York

... out of which 37.7% have children under the age of 18 living with them, 58.8% are married couples living together, 12.8% have a female householder with no husband present, ...

 
 
 
This page was created in 23.1 ms