本資料は、掲載誌(URI)等のリンク先にある学位授与機関のWebサイトやCiNii Dissertationsから、本文を自由に閲覧できる場合があります。
Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs
Available in National Diet Library
Find on the publisher's website
国立国会図書館デジタルコレクション
Digital data available
Check on the publisher's website
DOI[10.14989/doctor.k20516]to the data of the same series
Search by Bookstore
Read this material in an accessible format.
Table of Contents
- No matches found in the table of contents
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.
Search by Bookstore
Read in Disability Resources
- Other Services
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.
- Material Type
- 博士論文
- Author/Editor
- Norhazwani, Md Yunos
- Author Heading
- Publication, Distribution, etc.
- Publication Date
- 2017-03-23
- Publication Date (W3CDTF)
- 2017-03-23
- Alternative Title
- 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム
- Contributor
- 永持, 仁太田, 快人山下, 信雄
- Degree grantor/type
- 京都大学