Downloads: 242
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
djohk00758.pdf | Dissertation_全文 | 1.1 MB | Adobe PDF | View/Open |
yjohk00758.pdf | Abstract_要旨 | 216.38 kB | Adobe PDF | View/Open |
Title: | On Enumeration of Tree-Like Graphs and Pairwise Compatibility Graphs |
Other Titles: | 木状グラフ及び対互換性グラフの列挙 |
Authors: | Naveed, Ahmed Azam |
Author's alias: | ナビード, アフマド アザム |
Keywords: | Enumeration Chemical graphs Pairwise compatibility graphs Dynamic programming Branch and bound algorithm Linear programming |
Issue Date: | 23-Mar-2021 |
Publisher: | Kyoto University |
Conferring University: | 京都大学 |
Degree Level: | 新制・課程博士 |
Degree Discipline: | 博士(情報学) |
Degree Report no.: | 甲第23322号 |
Degree no.: | 情博第758号 |
Conferral date: | 2021-03-23 |
Degree Call no.: | 新制||情||129(附属図書館) |
Degree Affiliation: | 京都大学大学院情報学研究科数理工学専攻 |
Examination Committee members: | (主査)教授 永持 仁, 教授 太田 快人, 教授 山下 信雄 |
Provisions of the Ruling of Degree: | 学位規則第4条第1項該当 |
Rights: | Parts of this thesis have been published in: Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi, “A method for enumerating pairwise compatibility graphs with a given number of vertices”, Discrete Applied Mathematics 2020, doi: 10.3390/e22090923. Copyright (c) 2020 Elsevier Naveed Ahmed Azam, Aleksandar Shurbevski and Hiroshi Nagamochi, “On the Enumeration of Minimal Non-Pairwise Compatibility Graphs”, In Proceedings of The 26th International Computing and Combinatorics Conference (COCOON 2020), Computing and Combinatorics, Editors D. Kim et al., LNCS 12273, pp. 372–383, 2020, https://doi.org/10.1007/978-3-030-58150-3_30 Copyright (c) 2020 Springer Nature Switzerland |
DOI: | 10.14989/doctor.k23322 |
URI: | http://hdl.handle.net/2433/263783 |
dc.relation.haspart: | https://doi.org/10.3390/e22090923 https://doi.org/10.1007/978-3-030-58150-3_30 |
Appears in Collections: | 140 Doctoral Dissertation (Informatics) |

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.