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

Author
    • Naveed, Ahmed Azam
Bibliographic Information
Title

On Enumeration of Tree-Like Graphs and Pairwise Compatibility Graphs

Other Title

木状グラフ及び対互換性グラフの列挙

Author

Naveed, Ahmed Azam

University

京都大学

Types of degree

博士(情報学)

Grant ID

甲第23322号

Degree year

2021-03-23

Note and Description

元資料の権利情報 : 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

Table of Contents
  1. 2023-09-08 再収集 (3コマ目)
  2. 2023-09-08 再収集 (4コマ目)
4access
Codes
  • NII Article ID (NAID)
    500001462074
  • NII Author ID (NRID)
    • 8000001805811
  • DOI(JaLC)
  • DOI
  • Text Lang
    • eng
  • Source
    • Institutional Repository
    • NDL Digital Collections
Page Top