Enumeration of Non-isomorphic Unordered Trees with Degree Sequence Constraints

• Item type: SIG Technical Reports(1)
• 公開日: 2023-05-03
• タイトル: Enumeration of Non-isomorphic Unordered Trees with Degree Sequence Constraints
• タイトル / 言語: en
• タイトル: Enumeration of Non-isomorphic Unordered Trees with Degree Sequence Constraints
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: NTT Communication Science Laboratories, NTT Corporation
• 著者所属: Hokkaido University
• 著者所属: Nagoya University
• 著者所属: Ochanomizu University
• 著者所属: Hokkaido University
• 著者所属: Housei University
• 著者所属(英): en
• 著者所属(英): NTT Communication Science Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): Hokkaido University
• 著者所属(英): en
• 著者所属(英): Nagoya University
• 著者所属(英): en
• 著者所属(英): Ochanomizu University
• 著者所属(英): en
• 著者所属(英): Hokkaido University
• 著者所属(英): en
• 著者所属(英): Housei University
• 著者名: Shuhei, Denzumi; Takashi, Horiyama; Kazuhiro, Kurita; Atsuki, Nagao; Kazuhisa, Seto; Kunihiro, Wasa
• 著者名(英): Shuhei, Denzumi; Takashi, Horiyama; Kazuhiro, Kurita; Atsuki, Nagao; Kazuhisa, Seto; Kunihiro, Wasa
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Enumerating non-isomorphic rooted ordered trees satisfying the given number of vertices and edges has been studied with several constraints. Especially, efficient enumeration algorithms have been developed for basic constraints such as the number of leaves and diameter constraints. However, the total number of ordered trees is huge, and even if an efficient enumeration algorithm is given, it is not easy to enumerate solutions. One way to solve this problem is to reduce the number of solutions. Thus, we give an algorithm to enumerate non-isomorphic trees instead of rooted ordered trees. Furthermore, we give an efficient algorithm to enumerate non-isomorphic trees satisfying the degree sequence constraints.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Enumerating non-isomorphic rooted ordered trees satisfying the given number of vertices and edges has been studied with several constraints. Especially, efficient enumeration algorithms have been developed for basic constraints such as the number of leaves and diameter constraints. However, the total number of ordered trees is huge, and even if an efficient enumeration algorithm is given, it is not easy to enumerate solutions. One way to solve this problem is to reduce the number of solutions. Thus, we give an algorithm to enumerate non-isomorphic trees instead of rooted ordered trees. Furthermore, we give an efficient algorithm to enumerate non-isomorphic trees satisfying the degree sequence constraints.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2023-AL-193, 号 11, p. 1-6, 発行日 2023-05-03
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8566
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会