Algebraic and computer-based methods in the undirected degree=diameter problem – a brief survey
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large undirected graphs with given degree and diameter.
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10459.1/64911 |
| Acceso en línea: | https://doi.org/10.5614/ejgta.2014.2.2.9 http://hdl.handle.net/10459.1/64911 |
| Access Level: | acceso abierto |
| Palabra clave: | Undirected graphs Graph diameter Degree/diameter problem Cayley graphs |
| Sumario: | This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large undirected graphs with given degree and diameter. |
|---|