TY - GEN
T1 - A Faster Algorithm to Search for Generalized Moore Graphs
AU - Hirayama, Taku
AU - Migita, Tsuyoshi
AU - Takahashi, Norikazu
N1 - Funding Information:
This work was supported by JSPS KAKENHI Grant Number JP21H03510.
Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - An undirected regular graph whose average shortest path length (ASPL) is equal to a certain lower bound is called a generalized Moore graph (GMG). Computer networks in data centers are often modeled as undirected regular graphs, and data transmission latency in a network is closely related to the ASPL of the corresponding graph. Therefore, finding a GMG with prescribed order and degree is an important problem for designing low-latency networks. Although this problem has been studied in graph theory for many years, the conditions for existence of a GMG is still not clear. In addition, there is no fast algorithm to search for GMGs. In this paper, we propose a modified version of an existing depth-first search algorithm for GMGs, and verify its effectiveness through experiments.
AB - An undirected regular graph whose average shortest path length (ASPL) is equal to a certain lower bound is called a generalized Moore graph (GMG). Computer networks in data centers are often modeled as undirected regular graphs, and data transmission latency in a network is closely related to the ASPL of the corresponding graph. Therefore, finding a GMG with prescribed order and degree is an important problem for designing low-latency networks. Although this problem has been studied in graph theory for many years, the conditions for existence of a GMG is still not clear. In addition, there is no fast algorithm to search for GMGs. In this paper, we propose a modified version of an existing depth-first search algorithm for GMGs, and verify its effectiveness through experiments.
KW - depth-first search
KW - generalized Moore graph
KW - reduction of search space
UR - http://www.scopus.com/inward/record.url?scp=85145651730&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85145651730&partnerID=8YFLogxK
U2 - 10.1109/TENCON55691.2022.9977538
DO - 10.1109/TENCON55691.2022.9977538
M3 - Conference contribution
AN - SCOPUS:85145651730
T3 - IEEE Region 10 Annual International Conference, Proceedings/TENCON
BT - Proceedings of 2022 IEEE Region 10 International Conference, TENCON 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE Region 10 International Conference, TENCON 2022
Y2 - 1 November 2022 through 4 November 2022
ER -