Disperser

From Wikipedia, the free encyclopedia

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

An extractor is a related graph that guarantees an even stronger property. Every (N, M, D, K, e)-extractor is also an (N, M, D, K, e)-disperser.

Disperser may also mean a high-speed mixing devise used to disperse pigments and other solids into a liquid phase. Also used for dissolving solids in a solvent.

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../d/i/s/Disperser.html"