{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00185671","sets":["1164:2592:9368:9369"]},"path":["9369"],"owner":"11","recid":"185671","title":["木幅問題の貪欲解法の巨大グラフを対象とした実験的評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-01-21"},"_buckets":{"deposit":"c0580124-eef1-4612-b517-8748b769f242"},"_deposit":{"id":"185671","pid":{"type":"depid","value":"185671","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"木幅問題の貪欲解法の巨大グラフを対象とした実験的評価","author_link":["413716","413717","413715","413714"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"木幅問題の貪欲解法の巨大グラフを対象とした実験的評価"}]},"item_type_id":"4","publish_date":"2018-01-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"明治大学"},{"subitem_text_value":"明治大学"},{"subitem_text_value":"明治大学"},{"subitem_text_value":"明治大学"}]},"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/185671/files/IPSJ-AL18166012.pdf","label":"IPSJ-AL18166012.pdf"},"date":[{"dateType":"Available","dateValue":"2020-01-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL18166012.pdf","filesize":[{"value":"418.9 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":"91097452-fc9c-4437-83f9-c8344f08737f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 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":[{}]},{"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":"木幅問題には完全削除順序を用いた，頂点選択のためのいくつかの評価基準に基づく貪欲解法が知られている．Bodlaender と Koster は小さなグラフの多くは，貪欲解法で得られる幅と木幅がほとんど変わらないことを示した．本稿では巨大なグラフに対して実験を行い評価する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2018-01-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"2018-AL-166"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":185671,"updated":"2025-01-20T02:53:36.331160+00:00","links":{},"created":"2025-01-19T00:52:45.469000+00:00"}