A Faster Algorithm to Search for Generalized Moore Graphs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of 2022 IEEE Region 10 International Conference, TENCON 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665450959
DOIs
Publication statusPublished - 2022
Event2022 IEEE Region 10 International Conference, TENCON 2022 - Virtual, Online, Hong Kong
Duration: Nov 1 2022Nov 4 2022

Publication series

NameIEEE Region 10 Annual International Conference, Proceedings/TENCON
Volume2022-November
ISSN (Print)2159-3442
ISSN (Electronic)2159-3450

Conference

Conference2022 IEEE Region 10 International Conference, TENCON 2022
Country/TerritoryHong Kong
CityVirtual, Online
Period11/1/2211/4/22

Keywords

  • depth-first search
  • generalized Moore graph
  • reduction of search space

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A Faster Algorithm to Search for Generalized Moore Graphs'. Together they form a unique fingerprint.

Cite this