雑誌情報処理学会研究報告
Volume number2008(5)-2008(9):2008.1.22-2008.1.31
Articled-claw fre...

d-claw freeグラフの重み付き最大独立集合問題に対するタブーサーチ法の提案 (アルゴリズム)

Icons representing 記事

d-claw freeグラフの重み付き最大独立集合問題に対するタブーサーチ法の提案

(アルゴリズム)

Call No. (NDL)
Z14-1121
Bibliographic ID of National Diet Library
9373496
Material type
記事
Author
青木 一正ほか
Publisher
東京 : 情報処理学会
Publication date
2008-01-23
Material Format
Paper
Journal name
情報処理学会研究報告 = IPSJ SIG technical reports 2008(6) 2008.1.23
Publication Page
p.1～8
View All

Holdings of Libraries in Japan

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

List of Cooperating Institutions and Databases

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.
    Check the holdings of this book

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
記事
Title
d-claw freeグラフの重み付き最大独立集合問題に対するタブーサーチ法の提案
Author/Editor
青木 一正
大舘 陽太
山崎 浩一
Series Title
アルゴリズム
Author Heading
青木 一正
大舘 陽太
山崎 浩一
Alternative Title
A tabu search approach for the maximum weighted independent set problem on d-claw free graphs
Periodical title
情報処理学会研究報告 = IPSJ SIG technical reports
No. or year of volume/issue
2008(6) 2008.1.23
Volume
2008
Issue
6