{"created":"2025-01-19T01:32:25.695019+00:00","updated":"2025-01-19T10:37:01.031570+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231872","sets":["1164:2592:11452:11453"]},"path":["11453"],"owner":"44499","recid":"231872","title":["ノード番号操作を基にしたパターンマッチングによるグラフ同型問題解法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-01-13"},"_buckets":{"deposit":"e1734674-766e-4bb2-a702-fc72ef8f019d"},"_deposit":{"id":"231872","pid":{"type":"depid","value":"231872","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ノード番号操作を基にしたパターンマッチングによるグラフ同型問題解法の提案","author_link":["627125"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ノード番号操作を基にしたパターンマッチングによるグラフ同型問題解法の提案"},{"subitem_title":"Proposal of a graph isomorphism problem solving method using pattern matching based on node number manipulation","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-01-13","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"情報処理学会／現在，富士通株式会社"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"IPSJ / Presently with Fujitsu, Corp.","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/231872/files/IPSJ-AL24196009.pdf","label":"IPSJ-AL24196009.pdf"},"date":[{"dateType":"Available","dateValue":"2026-01-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24196009.pdf","filesize":[{"value":"888.5 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":"0903dd53-5a81-455c-9e1c-5d806fce9ab3","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":"高野, 茂幸"}],"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":"グラフ同型問題は構造や関係性を表現するのに適しており，応用分野は創薬，機能性材料，ソーシャルネットワークなど様々である．本論文ではグラフ同型問題（部分グラフ同型問題も含む）を従来とは異なる方法で解く方法を提案する．従来の方法は推定或いは探索アルゴリズムを基にしたものであるが，本研究はノード番号を操作して疎行列表現形式上でパターンマッチングにより解く．この論文ではそのアルゴリズムの基本を説明したうえで初期評価結果を報告する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-01-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2024-AL-196"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231872,"links":{}}