CUDAを利用した有向非循環グラフにおける全点間最短経路探索高速化手法 (VLSI設計技術)

CUDAを利用した有向非循環グラフにおける全点間最短経路探索高速化手法

(VLSI設計技術)

Journal name: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110(432) 2011.3.2-4

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

CiNii Research
Search Service
You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
Check the holdings of this book

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 記事
Title: CUDAを利用した有向非循環グラフにおける全点間最短経路探索高速化手法
Author/Editor: 山村亮英
高島康裕
Series Title: VLSI設計技術
Author Heading: 山村亮英
高島康裕
Alternative Title: Fast algorithm for all-pair shortest path on DAG using CUDA
Periodical title: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue: 110(432) 2011.3.2-4
Volume: 110
Issue: 432
Pages: 135～139
Publication date of volume/issue (W3CDTF): 2011-03
ISSN (Periodical Title): 0913-5685
ISSN-L (Periodical Title): 0913-5685
Publication (Periodical Title): 東京 : 電子情報通信学会
Place of Publication (Country Code): JP
Text Language Code: jpn
Subject Heading: CUDA
有向非循環グラフ
全点間最短経路探索
Directed acyclic graph
All-pair shortest path
NDLC: ZN33
Target Audience: 一般
Report No. (Article): VLD2010-139
Holding library: 国立国会図書館
Call No.: Z16-940
Data Provider (Database): 国立国会図書館 : 国立国会図書館雑誌記事索引
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 11048244
http://id.ndl.go.jp/bib/11048244
Bibliographic Record Category (NDL): 632