Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2022-06-09 17:40
Speeding up an algorithm for searching generalized Moore graphs
Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2022-11 CCS2022-11
Abstract (in Japanese) (See Japanese page) 
(in English) Computer networks in data centers are modeled as undirected regular graphs, and the average shortest path length (ASPL) of such a graph is closely related to data transmission latency in the corresponding computer network. Therefore, finding an undirected regular graph with a short ASPL is an important issue for low-latency network design. Regular graphs whose ASPLs are equal to certain theoretical lower bounds are called generalized Moore graphs, and have been studied in the field of graph theory for many years. However, the conditions on the number of vertices and the degree for a generalized Moore graph to exist have not been clarified, nor is there a fast algorithm for determining its existence. In this report, we propose a modified version of an existing depth-first search algorithm for generalized Moore graphs, and verify its effectiveness experimentally. In the proposed algorithm, new ideas for reducing the number of edges to be searched and changing the order of edge search adaptively are introduced. Experimental results show that these ideas are effective in practice.
Keyword (in Japanese) (See Japanese page) 
(in English) graph theory / generalized Moore graph / average shortest path length / / / / /  
Reference Info. IEICE Tech. Rep., vol. 122, no. 65, NLP2022-11, pp. 52-57, June 2022.
Paper # NLP2022-11 
Date of Issue 2022-06-02 (NLP, CCS) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF NLP2022-11 CCS2022-11

Conference Information
Committee CCS NLP  
Conference Date 2022-06-09 - 2022-06-10 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To NLP 
Conference Code 2022-06-CCS-NLP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Speeding up an algorithm for searching generalized Moore graphs 
Sub Title (in English)  
Keyword(1) graph theory  
Keyword(2) generalized Moore graph  
Keyword(3) average shortest path length  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Taku Hirayama  
1st Author's Affiliation Okayama University (Okayama Univ.)
2nd Author's Name Tsuyoshi Migita  
2nd Author's Affiliation Okayama University (Okayama Univ.)
3rd Author's Name Norikazu Takahashi  
3rd Author's Affiliation Okayama University (Okayama Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2022-06-09 17:40:00 
Presentation Time 25 minutes 
Registration for NLP 
Paper # NLP2022-11, CCS2022-11 
Volume (vol) vol.122 
Number (no) no.65(NLP), no.66(CCS) 
Page pp.52-57 
#Pages 6 
Date of Issue 2022-06-02 (NLP, CCS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan