2026-03-14T10:13:17Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00241017 2025-01-19T07:46:15Z 1164:2592:11452:11789

SSD Set System, Graph Decomposition and Hamiltonian Cycle SSD Set System, Graph Decomposition and Hamiltonian Cycle Shota, Kan Kazuya, Haraguchi Shota, Kan Kazuya, Haraguchi In this paper, we first study what we call Superset-Subset-Disjoint (SSD) set system. Based on properties of SSD set system, we derive the following (I) to (IV): (I) For a nonnegative integer k and a graph G = (V, E) with In this paper, we first study what we call Superset-Subset-Disjoint (SSD) set system. Based on properties of SSD set system, we derive the following (I) to (IV): (I) For a nonnegative integer k and a graph G = (V, E) with technical report 情報処理学会 2024-11-19 application/pdf 研究報告アルゴリズム（AL） 1 2024-AL-200 1 8 2188-8566 AN1009593X https://ipsj.ixsq.nii.ac.jp/record/241017/files/IPSJ-AL24200001.pdf eng