Title:
|
Searching for large multi-loop networks
|
Author:
|
Feria Purón, Ramiro; Pérez Rosés, Hebert; Ryan, Joe
|
Notes:
|
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. |
Subject(s):
|
-Network design -Circulant graphs -Multi-loop networks -Delannoy numbers -Xarxes d'ordinadors -Teoria de grafs -Computer networks -Graph theory |
Rights:
|
(c) Elsevier, 2014
info:eu-repo/semantics/restrictedAccess |
Document type:
|
Article publishedVersion |
Published by:
|
Elsevier
|
Share:
|
|