| ENCYCLOPEDIA 4U .com |
Encyclopedia Home Page |
|
|
DisperserAn (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).
|
Content on this web site is provided for informational purposes only. We accept no responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site. We encourage you to verify any critical information with the relevant authorities.
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Disperser".