{"links":{},"id":220582,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220582","sets":["6504:11035:11037"]},"path":["11037"],"owner":"44499","recid":"220582","title":["DAGに対する幅とアルゴリズムに関する一考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-17"},"_buckets":{"deposit":"8f7c6828-f582-4392-815b-14b5fdbbb340"},"_deposit":{"id":"220582","pid":{"type":"depid","value":"220582","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"DAGに対する幅とアルゴリズムに関する一考察","author_link":["577135","577137","577134","577136"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"DAGに対する幅とアルゴリズムに関する一考察"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2022-02-17","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京大"},{"subitem_text_value":"京大"},{"subitem_text_value":"京大"},{"subitem_text_value":"奈良先端大"}]},"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/220582/files/IPSJ-Z84-5K-05.pdf","label":"IPSJ-Z84-5K-05.pdf"},"date":[{"dateType":"Available","dateValue":"2022-10-22"}],"format":"application/pdf","filename":"IPSJ-Z84-5K-05.pdf","filesize":[{"value":"134.5 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"b1cc72ba-a24a-4bf9-b2a3-8a72aa6bfc32","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"森, 順平"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川原, 純"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"湊, 真一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"笠原, 正治"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究では非巡回有向グラフ（DAG）に対する幅とアルゴリズムについて考察する。グラフ上の問題について何らかのパラメータを利用してある種の問題を効率的に解く手法は多く研究されているが、DAG上の問題に対して有効なものは多くない。本研究は幅の小さいDAG上の問題を効率的に解くことを目標とする。本研究の貢献は二つに分けられる。一つ目として有向グラフにおける幅を提案する。この幅はそのグラフの有向パスへの近さを表す。無向グラフにおける幅として有名なパス幅の拡張として定義する。二つ目としてDAG上のある種の問題に対して幅が小さいとき効率的に動作するアルゴリズムを設計する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"230","bibliographic_titles":[{"bibliographic_title":"第84回全国大会講演論文集"}],"bibliographicPageStart":"229","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:20:37.063936+00:00","updated":"2025-01-19T14:30:50.081402+00:00"}