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!
|
| _version_ | 1849412008400650240 |
|---|---|
| author | DARÍO ALEJANDRO GARCÍA |
| author_facet | DARÍO ALEJANDRO GARCÍA |
| author_sort | DARÍO ALEJANDRO GARCÍA |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-51321dbd802c44d8a762ed0437536fc2 |
| institution | Kabale University |
| issn | 2357-3716 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Corporación Universitaria Republicana |
| record_format | Article |
| series | Revista Ingeniería, Matemáticas y Ciencias de la Información |
| spelling | doaj-art-51321dbd802c44d8a762ed0437536fc22025-08-20T03:34:35ZengCorporación Universitaria RepublicanaRevista Ingeniería, Matemáticas y Ciencias de la Información2357-37162019-01-01611738310.21017/rimci.2019.v6.n11.a57GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE IIDARÍO ALEJANDRO GARCÍA0https://orcid.org/0000-0002-5141-7346Universidad de los AndesExpansion 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.https://ojs.urepublicana.edu.co/index.php/ingenieria/article/view/501cryptographymathematicscomputer sciencesecurity |
| spellingShingle | DARÍO ALEJANDRO GARCÍA GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II Revista Ingeniería, Matemáticas y Ciencias de la Información cryptography mathematics computer science security |
| title | GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II |
| title_full | GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II |
| title_fullStr | GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II |
| title_full_unstemmed | GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II |
| title_short | GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II |
| title_sort | grafos expansores en criptografia parte ii |
| topic | cryptography mathematics computer science security |
| url | https://ojs.urepublicana.edu.co/index.php/ingenieria/article/view/501 |
| work_keys_str_mv | AT darioalejandrogarcia grafosexpansoresencriptografiaparteii |