| Presentation | 2018-06-10 Some Efficient Methods for Searching Generalized Moore Graphs Yoshiki Satotani, Norikazu Takahashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(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) |
| Keyword(in English) | graph theory / generalized Moore graph / average shortest path length |
| Paper # | NLP2018-43,CCS2018-16 |
| Date of Issue | 2018-06-01 (NLP, CCS) |
| Conference Information | |
| Committee | NLP / CCS |
|---|---|
| Conference Date | 2018/6/8(3days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyoto Terrsa |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Synchronization, Networks, etc |
| Chair | Norikazu Takahashi(Okayama Univ.) / Mikio Hasegawa(Tokyo Univ. of Science) |
| Vice Chair | Hiroaki Kurokawa(Tokyo University of Tech.) / Makoto Naruse(NICT) / Shigeki Shokawa(Kanagawa Inst. of Tech.) |
| Secretary | Hiroaki Kurokawa(Hiroshima Inst. of Tech.) / Makoto Naruse(Nippon Institute of Tech.) / Shigeki Shokawa(Tokyo City Univ.) |
| Assistant | Masayuki Kimura(Kyoto Univ.) / Yutaka Shimada(Saitama Univ.) / Yuusuke Kawakita(Kanagawa Inst. of Tech.) / Hiroyasu Ando(Univ. of Tsukuba) / Takashi Matsubara(Kobe Univ.) / Ryo Takahashi(AUT) |
| Paper Information | |
| Registration To | Technical Committee on Nonlinear Problems / Technical Committee on Complex Communication Sciences |
|---|---|
| Language | JPN |
| 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 |
| 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.) |
| Date | 2018-06-10 |
| Paper # | NLP2018-43,CCS2018-16 |
| Volume (vol) | vol.118 |
| Number (no) | NLP-75,CCS-76 |
| Page | pp.pp.85-90(NLP), pp.85-90(CCS), |
| #Pages | 6 |
| Date of Issue | 2018-06-01 (NLP, CCS) |