Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10459.1/47996
|
Título:
|
Searching for large multi-loop networks
|
|
Autor/a:
|
Feria Purón, Ramiro; Pérez Rosés, Hebert; Ryan, Joe
|
|
Notas:
|
We describe and implement a computer-based method to find large multi-loop graphs with given degree and diameter. For some values of degree and diame- ter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table. |
|
Materia(s):
|
-Network design
-Circulant graphs
-Multi-loop networks
-Delannoy numbers
-Xarxes d'ordinadors
-Teoria de grafs
-Computer networks
-Graph theory |
|
Derechos:
|
(c) Elsevier, 2014
info:eu-repo/semantics/restrictedAccess |
|
Tipo de documento:
|
Artículo
publishedVersion |
|
Editor:
|
Elsevier
|
|
Compartir:
|
|
Documentos con el texto completo de este documento
Mostrar el registro completo del ítem
