| Presentation | 2018-01-26 Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs Ryoya Ishii, Norikazu Takahashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The Generalized de Bruijn Graphs (GDBG) are a class of directed regular graphs. Since the average shortest path length of a GDBG is short, there have been some attempts to design computer networks in data centers by using the idea of GDBGs. However, GDBGs contain some useless edges such as loops, and thus cannot be directly applied to the design of undirected regular graphs, which are generally used for network models. In this report, we propose some algorithms to construct simple undirected 4 and 3-regular graphs based on GDBGs, prove their validity, and evaluate numerically the average shortest path length and the diameter of obtained graphs. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | network / generalized de Bruijn graph / random regular graph / average shortest path length / diameter |
| Paper # | NLP2017-90 |
| Date of Issue | 2018-01-19 (NLP) |
| Conference Information | |
| Committee | MBE / NC / NLP |
|---|---|
| Conference Date | 2018/1/26(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyushu Institute of Technology |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | ME, generalImplementation of Neuro Computing,Analysis and Modeling of Human Science, |
| Chair | Kazuki Nakajima(Univ. of Toyama) / Masafumi Hagiwara(Keio Univ.) / Masaharu Adachi(Tokyo Denki Univ.) |
| Vice Chair | Masaki Kyoso(TCU) / Yutaka Hirata(Chubu Univ.) / Norikazu Takahashi(Okayama Univ.) |
| Secretary | Masaki Kyoso(Toyama Pref. Univ.) / Yutaka Hirata(Kindai Univ.) / Norikazu Takahashi(Tokyo Inst. of Tech.) |
| Assistant | Kim Juhyon(Univ. of Toyama) / Takumi Kobayashi(YNU) / Yoshihisa Shinozawa(Keio Univ.) / Keiichiro Inagaki(Chubu Univ.) / Toshihiro Tachibana(Shonan Inst. of Tech.) / Masayuki Kimura(Kyoto Univ.) |
| Paper Information | |
| Registration To | Technical Committee on ME and Bio Cybernetics / Technical Committee on Neurocomputing / Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs |
| Sub Title (in English) | |
| Keyword(1) | network |
| Keyword(2) | generalized de Bruijn graph |
| Keyword(3) | random regular graph |
| Keyword(4) | average shortest path length |
| Keyword(5) | diameter |
| 1st Author's Name | Ryoya Ishii |
| 1st Author's Affiliation | Okayama University(Okayama Univ.) |
| 2nd Author's Name | Norikazu Takahashi |
| 2nd Author's Affiliation | Okayama University(Okayama Univ.) |
| Date | 2018-01-26 |
| Paper # | NLP2017-90 |
| Volume (vol) | vol.117 |
| Number (no) | NLP-415 |
| Page | pp.pp.23-28(NLP), |
| #Pages | 6 |
| Date of Issue | 2018-01-19 (NLP) |