NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.175 seconds)

Spelling suggestions: "subject:"exact exponential algorithm"" "subject:"exact exponential dalgorithm""

1

Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs / 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム

Norhazwani, Md Yunos 23 March 2017 (has links)
京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第20516号 / 情博第644号 / 新制||情||111(附属図書館) / 京都大学大学院情報学研究科数理工学専攻 / (主査)教授 永持 仁, 教授 太田 快人, 教授 山下 信雄 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM
Traveling Salesman Problem
Exact Exponential Algorithm
Branch-and-reduce
Measure-and-conquer
007

Page generated in 0.1773 seconds