GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II
Expansion graphs are a class of graphs that have two apparently contradictory properties: they are sparse and wellconnected. These graphs have important applications in computer science, such as the construction of optimized networkconfigurations and, as we will see later, the construction of good g...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Corporación Universitaria Republicana
2019-01-01
|
| Series: | Revista Ingeniería, Matemáticas y Ciencias de la Información |
| Subjects: | |
| Online Access: | https://ojs.urepublicana.edu.co/index.php/ingenieria/article/view/501 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Expansion graphs are a class of graphs that have two apparently contradictory properties: they are sparse and wellconnected. These graphs have important applications in computer science, such as the construction of optimized networkconfigurations and, as we will see later, the construction of good graph-based summary functions. |
|---|---|
| ISSN: | 2357-3716 |