BibTeX
@MISC{n.n._expandergraphs,
author = {n.n.},
title = { Expander Graphs},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Now that we have seen a variety of basic derandomization techniques, we will move on to study the first major “pseudorandom object” in this survey, expander graphs. These are graphs that are “sparse” yet very “well-connected.”
Keyphrases
expander graph infinite family graph gi asymptotic sense first major pseudorandom object many neighbor vertex expansion not-too-large set degree di basic derandomization technique well-connectedness property call digraph undirected multigraphs different interpretation vertex ni classic measure
