{"created":"2025-01-19T01:46:47.047380+00:00","updated":"2025-01-19T07:30:13.285086+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241899","sets":["1164:2592:11887:11888"]},"path":["11888"],"owner":"44499","recid":"241899","title":["最大次数3の平面的グラフにおける事前割当による最小頂点被覆の唯一化の計算困難性"],"pubdate":{"attribute_name":"公開日","attribute_value":"2025-01-07"},"_buckets":{"deposit":"024ea2bd-dbce-499a-b300-e8bffa71499d"},"_deposit":{"id":"241899","pid":{"type":"depid","value":"241899","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"最大次数3の平面的グラフにおける事前割当による最小頂点被覆の唯一化の計算困難性","author_link":["666779","666780","666778","666777"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最大次数3の平面的グラフにおける事前割当による最小頂点被覆の唯一化の計算困難性"}]},"item_type_id":"4","publish_date":"2025-01-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北海道大学"},{"subitem_text_value":"北海道大学"},{"subitem_text_value":"北海道大学"},{"subitem_text_value":"北海道大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/241899/files/IPSJ-AL25201011.pdf","label":"IPSJ-AL25201011.pdf"},"date":[{"dateType":"Available","dateValue":"2027-01-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL25201011.pdf","filesize":[{"value":"1.2 MB"}],"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":"b89e6d9e-460a-4b26-8929-b91d9c92ee65","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"坂本, 郁弥"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鈴木, 琉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"脊戸, 和寿"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"堀山, 貴史"}],"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":"与えられた n 頂点のグラフ G のうち，特定の頂点を頂点被覆に含める/含めないを選ぶことを事前割当という．事前割当を満たす G 上の最小頂点被覆が唯一となるような，k 頂点の事前割当が存在するかどうかを判定する問題を PAU-VC (Pre-Assginment for Uniquigying minimum Vertex Cover）という．Horiyama らは，PAU-VC が一般グラフ上で Σp2 完全となることを示し，2 部グラフ上では NP 完全となることを示した．本研究では，最大次数が 3 の平面的グラフに限ったとしても，PAU-VC が Σp2 完全であることを示す．","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":"2025-01-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"2025-AL-201"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":241899,"links":{}}