DomainTools.com |
 |
||
|
|
||
| Language: | ||||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Domains: | 6 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
Expander graph references on wikipedia
Expander_graph
combinatorics, an expander graph is a sparse graph which has high connectivity properties, quantified using vertex or edge expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to theoretical computer science, design of robust computer networks, and the theory of error-correcting codes.
combinatorics, an expander graph is a sparse graph which has high connectivity properties, quantified using vertex or edge expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to theoretical computer science, design of robust computer networks, and the theory of error-correcting codes.
| Description | |||
 Ams.org | American Mathematical Society | ||
| Huji.ac.il | האוניברסיטה העברית בירושלים | ||
| Ias.edu | Institute for Advanced Study | ||
| Qinfo.org | Qinfo.org | ||
| Uchicago.edu | The University of Chicago | ||
| Yann-ollivier.org | Yann Ollivier | ||
