Return to search

On Enumeration of Tree-Like Graphs and Pairwise Compatibility Graphs / 木状グラフ及び対互換性グラフの列挙

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第23322号 / 情博第758号 / 新制||情||129(附属図書館) / 京都大学大学院情報学研究科数理工学専攻 / (主査)教授 永持 仁, 教授 太田 快人, 教授 山下 信雄 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Identiferoai:union.ndltd.org:kyoto-u.ac.jp/oai:repository.kulib.kyoto-u.ac.jp:2433/263783
Date23 March 2021
CreatorsNaveed, Ahmed Azam
Contributorsナビード, アフマド アザム
PublisherKyoto University, 京都大学
Source SetsKyoto University
LanguageEnglish
Detected LanguageEnglish
Typedoctoral thesis, Thesis or Dissertation
RightsParts 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
Relationhttps://doi.org/10.3390/e22090923, https://doi.org/10.1007/978-3-030-58150-3_30

Page generated in 0.0021 seconds