{"created":"2023-06-19T10:30:29.950431+00:00","id":10944,"links":{},"metadata":{"_buckets":{"deposit":"d7aa3f9c-8646-42df-956a-bd79456d8889"},"_deposit":{"created_by":18,"id":"10944","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"10944"},"status":"published"},"_oai":{"id":"oai:muroran-it.repo.nii.ac.jp:00010944","sets":["216:489","46"]},"author_link":["59462"],"item_79_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2015","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicPageEnd":"1840","bibliographicPageStart":"1838","bibliographicVolumeNumber":"E98.A","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","bibliographic_titleLang":"en"}]}]},"item_79_description_23":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_79_description_7":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparability graphs of partially ordered sets with interval dimension at most 2 and height at most 2.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_79_link_17":{"attribute_name":"出版者版へのリンク","attribute_value_mlt":[{"subitem_link_text":"10.1587/transfun.E98.A.1838","subitem_link_url":"https://doi.org/10.1587/transfun.E98.A.1838"}]},"item_79_link_5":{"attribute_name":"室蘭工業大学研究者データベースへのリンク","attribute_value_mlt":[{"subitem_link_text":"髙岡 旭（TAKAOKA Asahi）","subitem_link_url":"http://rdsoran.muroran-it.ac.jp/html/200000242_ja.html"}]},"item_79_publisher_11":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"The Institute of Electronics, Information and Communication Engineers","subitem_publisher_language":"en"}]},"item_79_relation_18":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1587/transfun.E98.A.1838","subitem_relation_type_select":"DOI"}}]},"item_79_rights_19":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright(C)2015 IEICE","subitem_rights_language":"en"}]},"item_79_source_id_12":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0916-8508","subitem_source_identifier_type":"PISSN"}]},"item_79_version_type_21":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[{}],"affiliationNames":[{},{}]}],"creatorNames":[{"creatorName":"髙岡, 旭","creatorNameLang":"ja"},{"creatorName":"TAKAOKA, Asahi","creatorNameLang":"en"},{"creatorName":"タカオカ, アサヒ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-06-06"}],"displaytype":"detail","filename":"transfun_E98_A_1838.pdf","filesize":[{"value":"248.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"transfun_E98_A_1838","objectType":"fulltext","url":"https://muroran-it.repo.nii.ac.jp/record/10944/files/transfun_E98_A_1838.pdf"},"version_id":"aee5981a-743b-4e34-bdbf-10e8c39693ab"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"comparability graphs","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"graph isomorphism","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"interval dimension","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"trapezoid graphs","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Graph Isomorphism Completeness for Trapezoid Graphs","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Graph Isomorphism Completeness for Trapezoid Graphs","subitem_title_language":"en"}]},"item_type_id":"79","owner":"18","path":["46","489"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2023-06-06"},"publish_date":"2023-06-06","publish_status":"0","recid":"10944","relation_version_is_last":true,"title":["Graph Isomorphism Completeness for Trapezoid Graphs"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2023-10-24T01:35:59.034287+00:00"}