{"created":"2025-01-18T23:36:26.902366+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00082608","sets":["581:6644:6801"]},"path":["6801"],"owner":"11","recid":"82608","title":["Selected Slither Link Variants are NP-complete"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-06-15"},"_buckets":{"deposit":"064a6fdb-e311-4bf9-ae5d-c2409b9c37c5"},"_deposit":{"id":"82608","pid":{"type":"depid","value":"82608","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Selected Slither Link Variants are NP-complete","author_link":["358032","358031"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Selected Slither Link Variants are NP-complete"},{"subitem_title":"Selected Slither Link Variants are NP-complete","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：パズルの数理]  puzzles, combinatorics, computational complexity, NP-completeness","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2012-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Aarhus University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Aarhus University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/82608/files/IPSJ-JNL5306011.pdf","label":"IPSJ-JNL5306011"},"date":[{"dateType":"Available","dateValue":"2014-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5306011.pdf","filesize":[{"value":"554.0 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d92507ac-4b5a-4b5d-9e6e-1d23959f231a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Jonas, Kolker"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Jonas, Kolker","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In a Slither Link puzzle, the player must draw a cycle in a planar graph, such that the number of edges incident to a set of clue faces equals the set of given clue values. We show that for a number of commonly played graph classes, the Slither Link puzzle is NP-complete.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of \nInformation Processing(JIP). This preprint should not be cited. This \narticle should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.709\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In a Slither Link puzzle, the player must draw a cycle in a planar graph, such that the number of edges incident to a set of clue faces equals the set of given clue values. We show that for a number of commonly played graph classes, the Slither Link puzzle is NP-complete.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of \nInformation Processing(JIP). This preprint should not be cited. This \narticle should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.709\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2012-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"53"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":82608,"updated":"2025-01-20T06:51:01.679710+00:00","links":{}}