| Paper Abstract and Keywords |
| Presentation |
2018-06-10 11:20
Some Efficient Methods for Searching Generalized Moore Graphs Yoshiki Satotani, Norikazu Takahashi (Okayama Univ.) NLP2018-43 CCS2018-16 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
Computer networks used for high performance computing 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 in order to build 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 characteristics of GMGs. In this report, we propose some efficient methods for searching GMGs and examine their effectiveness by experiments. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
graph theory / generalized Moore graph / average shortest path length / / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 118, no. 75, NLP2018-43, pp. 85-90, June 2018. |
| Paper # |
NLP2018-43 |
| Date of Issue |
2018-06-01 (NLP, CCS) |
| ISSN |
Print edition: ISSN 0913-5685 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 |
NLP2018-43 CCS2018-16 |
| Conference Information |
| Committee |
NLP CCS |
| Conference Date |
2018-06-08 - 2018-06-10 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Kyoto Terrsa |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
Synchronization, Networks, etc |
| Paper Information |
| Registration To |
NLP |
| Conference Code |
2018-06-NLP-CCS |
| Language |
Japanese |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Some Efficient Methods 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 |
Yoshiki Satotani |
| 1st Author's Affiliation |
Okayama University (Okayama Univ.) |
| 2nd Author's Name |
Norikazu Takahashi |
| 2nd Author's Affiliation |
Okayama University (Okayama Univ.) |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 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 |
2018-06-10 11:20:00 |
| Presentation Time |
25 minutes |
| Registration for |
NLP |
| Paper # |
NLP2018-43, CCS2018-16 |
| Volume (vol) |
vol.118 |
| Number (no) |
no.75(NLP), no.76(CCS) |
| Page |
pp.85-90 |
| #Pages |
6 |
| Date of Issue |
2018-06-01 (NLP, CCS) |