Jump to main content

博士論文

Relaxations of Hard Graph Problems Using Finite Groups, and Characterizations of Graphs for Efficient Algorithms

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

Available in National Diet Library

Find on the publisher's website

NDL Digital Collections

Digital data available

Check on the publisher's website

Relaxations of Hard Graph Problems Using Finite Groups, and Characterizations of Graphs for Efficient Algorithms

Persistent ID (NDL)
info:ndljp/pid/11336675
Material type
博士論文
Author
西山, 宏
Publisher
-
Publication date
2019-03-20
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. から、本文を自由に閲覧できる場合があります。

Search by Bookstore

Search by Bookstore

Read this material in an accessible format.

View materials in accessible formats for people with print disabilities (1Type)

Search by Bookstore

Read in Disability Resources

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
博士論文
Title
Relaxations of Hard Graph Problems Using Finite Groups, and Characterizations of Graphs for Efficient Algorithms
Author/Editor
西山, 宏
Publication Date
2019-03-20
Publication Date (W3CDTF)
2019-03-20
Alternative Title
有限群を用いた計算困難なグラフ問題の緩和と，効率的アルゴリズムのためのグラフの特徴づけ
Contributor
来嶋, 秀治
瀧本, 英二
神山, 直之
Degree grantor/type
九州大学
Date Granted
2019-03-20
Date Granted (W3CDTF)
2019-03-20