{"created":"2025-01-19T01:28:04.560807+00:00","updated":"2025-01-19T11:39:47.885442+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228945","sets":["1164:2592:11085:11360"]},"path":["11360"],"owner":"44499","recid":"228945","title":["Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-11-09"},"_buckets":{"deposit":"8ee3dead-7655-46c2-873f-309bb2d0aad6"},"_deposit":{"id":"228945","pid":{"type":"depid","value":"228945","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs","author_link":["614876","614878","614879","614874","614877","614875"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs"},{"subitem_title":"Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-11-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University"},{"subitem_text_value":"Hokkaido University"},{"subitem_text_value":"Hokkaido University"}]},"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"}]},"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/228945/files/IPSJ-AL23195025.pdf","label":"IPSJ-AL23195025.pdf"},"date":[{"dateType":"Available","dateValue":"2025-11-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23195025.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":"c1d824ea-1854-43cd-9ce0-df74aabb36a4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryu, Suzuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuhisa, Seto"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Horiyama"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryu, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuhisa, Seto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Horiyama","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":"The pre-assignment problem of the minimum dominating set is, given a graph G and a nonnegative integer k, to determine whether there exists a pair of sets of vertices Vpre = (Vex, Vin) such that ","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The pre-assignment problem of the minimum dominating set is, given a graph G and a nonnegative integer k, to determine whether there exists a pair of sets of vertices Vpre = (Vex, Vin) such that ","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-11-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"25","bibliographicVolumeNumber":"2023-AL-195"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228945,"links":{}}