| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
An (N,M,D,K,e)-disperser is a bipartite
graph with N nodes on the left side, each with degree D, and Mnodes 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).
Graphs