大規模グラフの最大ク...

大規模グラフの最大クリーク問題に対するソフトウェア・再構成可能ハードウェア協調解法 (VLSI設計技術)

Icons representing 記事

大規模グラフの最大クリーク問題に対するソフトウェア・再構成可能ハードウェア協調解法

(VLSI設計技術)

Call No. (NDL)
Z16-940
Bibliographic ID of National Diet Library
025281020
Material type
記事
Author
三浦 智香子ほか
Publisher
東京 : 電子情報通信学会
Publication date
2014-01
Material Format
Paper
Journal name
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113(416):2014.1.28・29
Publication Page
p.7-12
View All

Holdings of Libraries in Japan

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
    Paper
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.

Bibliographic Record

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

Paper

Material Type
記事
Author/Editor
三浦 智香子
永山 忍
若林 真一 他
Series Title
Alternative Title
A Unified Software/Reconfigurable Hardware Approach to Solving the Maximum Clique Problem of Large Graphs
Periodical title
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue
113(416):2014.1.28・29
Volume
113
Issue
416