Jump to main content
博士論文

グラフ上の分割問題と被覆問題:計算量解析とアルゴリズム設計

Icons representing 博士論文
The cover of this title could differ from library to library. Link to Help Page

グラフ上の分割問題と被覆問題:計算量解析とアルゴリズム設計

Persistent ID (NDL)
info:ndljp/pid/11690866
Material type
博士論文
Author
八木田, 剛
Publisher
-
Publication date
2021-03-25
Material Format
Digital
Capacity, size, etc.
-
Name of awarding university/degree
九州工業大学,博士(情報工学)
View All

Notes on use at the National Diet Library

本資料は、掲載誌(URI)等のリンク先にある学位授与機関のWebサイトやCiNii DissertationsLeave the NDL website. から、本文を自由に閲覧できる場合があります。

Notes on use

Note (General):

九州工業大学博士学位論文 学位記番号:情工博甲第355号 学位授与年月日:令和3年3月25日令和2年度

Detailed bibliographic record

Summary, etc.:

This dissertation studies four combinatorial optimization problems on graphs: (1) Minimum Block Transfer problem (MBT for short), (2) Maximum k-Path V...

Table of Contents

Provided by:国立国会図書館デジタルコレクションLink to Help Page
  • 2021-10-06 再収集

  • 2023-08-05 再収集

  • 2023-09-02 再収集

  • 2023-10-11 再収集

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

  • Kyutacar

    Digital
    You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).

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.

Digital

Material Type
博士論文
Author/Editor
八木田, 剛
Author Heading
Publication Date
2021-03-25
Publication Date (W3CDTF)
2021-03-25
Alternative Title
Graph Packing and Covering Problems -Computational Complexity and Algorithms Design -
Contributor
宮野, 英次
Degree grantor/type
九州工業大学
Date Granted
2021-03-25