Paper Info
Title
Depth-First Search Algorithms for Finding a Generalized Moore Graph
Abstract
Computer networks in data centers are often modeled by undirected regular graphs, and the average shortest path length (ASPL) of the graph is closely related to the data transmission latency. Therefore, finding an undirected regular graph with the minimum ASPL is an important problem for building a low latency network. An undirected regular graph is called a generalized Moore graph (GMG) when its ASPL is identical with the theoretical lower bound. Several methods have been proposed so far to find GMGs with given order and degree. However, they do not make a full use of the properties of GMGs. In this paper, we propose some efficient algorithms for finding a GMG and examine their effectiveness by experiments.
Year
DOI
Venue
2018
10.1109/tencon.2018.8650418
TENCON IEEE Region 10 Conference Proceedings
Keywords
Field
DocType
generalized Moore graph,depth-first search,network topology,average shortest path length,optimization
Moore graph,Shortest path problem,Data transmission,Upper and lower bounds,Computer science,Breadth-first search,Algorithm,Network topology,Regular graph,Latency (engineering)
Conference
ISSN
Citations 
PageRank 
2159-3442
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Yoshiki Satotani110.69
Norikazu Takahashi210416.21