{"created":"2025-01-19T01:32:25.121305+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231866","sets":["1164:2592:11452:11453"]},"path":["11453"],"owner":"44499","recid":"231866","title":["二分決定グラフを用いた時間的グラフにおける最短パスの列挙"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-01-13"},"_buckets":{"deposit":"6fad7344-9e06-40a7-9737-7cce9736bef4"},"_deposit":{"id":"231866","pid":{"type":"depid","value":"231866","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"二分決定グラフを用いた時間的グラフにおける最短パスの列挙","author_link":["627089","627088","627086","627087","627090","627085"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"二分決定グラフを用いた時間的グラフにおける最短パスの列挙"},{"subitem_title":"Enumerating Shortest Paths for Temporal Graphs using Zero-suppressed Binary Decision Diagrams","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":"奈良先端科学技術大学院大学先端科学技術研究科"},{"subitem_text_value":"奈良先端科学技術大学院大学先端科学技術研究科"},{"subitem_text_value":"奈良先端科学技術大学院大学先端科学技術研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nara Institute of Science and Technology, Graduate School of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Nara Institute of Science and Technology, Graduate School of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Nara Institute of Science and Technology, Graduate School of Science and Technology","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/231866/files/IPSJ-AL24196003.pdf","label":"IPSJ-AL24196003.pdf"},"date":[{"dateType":"Available","dateValue":"2026-01-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24196003.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":"1b91516e-7c31-4892-acb0-da73aac5f548","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":[{}]},{"creatorNames":[{"creatorName":"中畑, 裕"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"笠原, 正治"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Daiki, Ando","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yu, Nakahata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shoji, Kasahara","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":"ネットワークの頂点の重要性を測る尺度に媒介中心性がある．近年，各辺が時間変化するネットワークの媒介中心性が考えられており，その計算には最短パスの数え上げを要する．そうしたネットワークは時間的グラフによってモデル化され，異なる 4 つ最短の概念とそれに対応する最短パスが定義できる．一方，これらの最短パスの数え上げは多項式時間で列挙できるものもあるが，いくつかは #P 困難に分類される．そこで本研究では，二分決定グラフ（ZDD) を用いた各最短パスの列挙手法を提案する．いくつかのグラフデータに対する計算機実験により，ZDD 構築にかかる時間と解の個数，及び各最短パスを表す ZDD のサイズを比較する．","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":"2024-01-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2024-AL-196"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231866,"updated":"2025-01-19T10:37:10.931701+00:00","links":{}}