文献
J-GLOBAL ID:201702265511902695
整理番号:17A0826168
頂点枝刈りによる大規模グラフにおける高速連結成分計算【Powered by NICT】
Fast Connected Components Computation in Large Graphs by Vertex Pruning
著者 (5件):
Lulli Alessandro
(Department of Computer Science, University of Pisa, Pisa, Italy)
,
Carlini Emanuele
(Information Science and Technologies Institute “A. Faedo”, National Research Council of Italy, Rome, Italy)
,
Dazzi Patrizio
(Information Science and Technologies Institute “A. Faedo”, National Research Council of Italy, Rome, Italy)
,
Lucchese Claudio
(Information Science and Technologies Institute “A. Faedo”, National Research Council of Italy, Rome, Italy)
,
Ricci Laura
(Department of Computer Science, University of Pisa, Pisa, Italy)
資料名:
IEEE Transactions on Parallel and Distributed Systems
(IEEE Transactions on Parallel and Distributed Systems)
巻:
28
号:
3
ページ:
760-773
発行年:
2017年
JST資料番号:
T0882A
ISSN:
1045-9219
CODEN:
ITDSEO
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
アメリカ合衆国 (USA)
言語:
英語 (EN)