文献
J-GLOBAL ID:201702245376024654
整理番号:17A1637238
複雑性と最適性:不確実なグラフにおける出所目的地関係を解明する【Powered by NICT】
Complexity vs. optimality: Unraveling source-destination connection in uncertain graphs
著者 (5件):
Fu Xinzhe
(Dept. of {Computer Science, Electronic Engineering}, Shanghai Jiao Tong University, China)
,
Xu Zhiying
(Dept. of {Computer Science, Electronic Engineering}, Shanghai Jiao Tong University, China)
,
Peng Qianyang
(Dept. of {Computer Science, Electronic Engineering}, Shanghai Jiao Tong University, China)
,
Fu Luoyi
(Dept. of {Computer Science, Electronic Engineering}, Shanghai Jiao Tong University, China)
,
Wang Xinbing
(Dept. of {Computer Science, Electronic Engineering}, Shanghai Jiao Tong University, China)
資料名:
IEEE Conference Proceedings
(IEEE Conference Proceedings)
巻:
2017
号:
INFOCOM
ページ:
1-9
発行年:
2017年
JST資料番号:
W2441A
資料種別:
会議録 (C)
記事区分:
原著論文
発行国:
アメリカ合衆国 (USA)
言語:
英語 (EN)