@techreport{oai:ipsj.ixsq.nii.ac.jp:00172939,
 author = {中野, 浩嗣 and 高藤, 大介 and 藤田, 聡 and 松谷, 宏紀 and 藤原, 一毅 and 鯉渕, 道紘 and Koji, Nakano and Daisuke, Takafuji and Satoshi, Fujita and Hiroki, Matsutani and Ikki, Fujiwara and Michihiro, Koibuchi},
 issue = {43},
 month = {Aug},
 note = {In this work we present randomly optimized grid graphs that maximize the performance measure, such as diameter and average shortest path length (ASPL), with subject to limited edge length on a grid surface. We also provide theoretical lower bounds of the diameter and the ASPL, which prove optimality of our randomly optimized grid graphs. We further present a diagonal grid layout that significantly reduces the diameter compared to the conventional one under the edge-length limitation.},
 title = {低レイテンシーネットワークのためのランダムグリッドグラフ},
 year = {2016}
}