{"created":"2025-01-19T01:45:32.433675+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241017","sets":["1164:2592:11452:11789"]},"path":["11789"],"owner":"44499","recid":"241017","title":["SSD Set System, Graph Decomposition and Hamiltonian Cycle"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-11-19"},"_buckets":{"deposit":"60dbe92d-19d9-4d42-b36c-8d8c324d7291"},"_deposit":{"id":"241017","pid":{"type":"depid","value":"241017","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"SSD Set System, Graph Decomposition and Hamiltonian Cycle","author_link":["662843","662840","662841","662842"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"SSD Set System, Graph Decomposition and Hamiltonian Cycle"},{"subitem_title":"SSD Set System, Graph Decomposition and Hamiltonian Cycle","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-11-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/241017/files/IPSJ-AL24200001.pdf","label":"IPSJ-AL24200001.pdf"},"date":[{"dateType":"Available","dateValue":"2026-11-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24200001.pdf","filesize":[{"value":"933.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"16896a42-7f1b-42c8-b8e3-deac17787093","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shota, Kan"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuya, Haraguchi"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shota, Kan","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuya, Haraguchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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 ","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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 ","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-11-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024-AL-200"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":241017,"updated":"2025-01-19T07:46:15.004691+00:00","links":{}}