{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00113209","sets":["1164:2592:7834:7891"]},"path":["7891"],"owner":"11","recid":"113209","title":["準完全有向グラフとその一般化に対するパス幅計算について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-02-24"},"_buckets":{"deposit":"dffb8627-8222-426f-b301-d89b09295d71"},"_deposit":{"id":"113209","pid":{"type":"depid","value":"113209","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"準完全有向グラフとその一般化に対するパス幅計算について","author_link":["37306","37305","37304"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"準完全有向グラフとその一般化に対するパス幅計算について"}]},"item_type_id":"4","publish_date":"2015-02-24","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":"Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Gakushuin University","subitem_text_language":"en"},{"subitem_text_value":"Meiji University","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/113209/files/IPSJ-AL15152003.pdf"},"date":[{"dateType":"Available","dateValue":"2017-02-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL15152003.pdf","filesize":[{"value":"821.4 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":"558a5afd-c9e1-429a-ac66-de33a50829bf","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 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_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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"有向グラフ G は，その各頂点 u が 「辺 (u,v) も辺 (v,u) も存在しないような頂点 v≠u の個数は高々 h である」 という性質を満たすとき，h 準完全であるという．0 準完全な有向グラフは準完全有向グラフとして知られ，トーナメントはその特別な場合である．本稿では，n 頂点の h 準完全有向グラフ G と正整数 k が与えられたとき，G のパス幅が k 以下であるかを判定する (h+2k+1)2knO(1) 時間のアルゴリズムを与える．この結果は，Pilipczuk の準完全有向グラフに対する結果を （n に対する依存度の犠牲のもとに） 一般化している．我々のアルゴリズムは劣モジュラシステムにおける線形配置問題に対する Nagamochi のアルゴリズムを有向グラフのパス幅問題に特化し，我々の目的のために適合させたものである．「U を 入次数 （出次数） が k 以下であるような任意の頂点集合とするとき，U∪{v} の入次数 （出次数） が k 以下であるような頂点 v の個数は高々 b である」 という性質を満たす有向グラフに対してこのアルゴリズムの実行時間は b2knO(1) である．","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":"2015-02-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2015-AL-152"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-20T19:44:12.144567+00:00","created":"2025-01-18T23:54:50.161166+00:00","links":{},"id":113209}