Presentation 2016-12-22
[Invited Talk] How small can the diameter of an undirected graph be?
Ikki Fujiwara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English)
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # ISEC2016-86,COMP2016-47
Date of Issue 2016-12-14 (ISEC, COMP)

Conference Information
Committee COMP / ISEC
Conference Date 2016/12/21(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Hiroshima University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Hiroo Itoh(Univ. of Electro-Comm.) / Masahiro Mambo(Kanazawa Univ.)
Vice Chair Yuushi Uno(Osaka Pref. Univ.) / Kazuto Ogawa(NHK) / Atsushi Fujioka(Kanagawa Univ.)
Secretary Yuushi Uno(Seikei Univ.) / Kazuto Ogawa(Kobe Univ.) / Atsushi Fujioka(Toshiba)
Assistant / Toshihiro Ohigashi(Tokai Univ.) / Yuuji Suga(IIJ) / Atsuo Inomata(Tokyo Denki Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing / Technical Committee on Information Security
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) [Invited Talk] How small can the diameter of an undirected graph be?
Sub Title (in English) Toward low-latency large-scale interconnection networks
Keyword(1)
1st Author's Name Ikki Fujiwara
1st Author's Affiliation National Institute of Information and Communications Technology(NICT)
Date 2016-12-22
Paper # ISEC2016-86,COMP2016-47
Volume (vol) vol.116
Number (no) ISEC-380,COMP-381
Page pp.pp.79-79(ISEC), pp.79-79(COMP),
#Pages 1
Date of Issue 2016-12-14 (ISEC, COMP)