{"updated":"2025-01-21T11:06:42.156186+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00101704","sets":["1164:2592:7425:7606"]},"path":["7606"],"owner":"11","recid":"101704","title":["K-縮退グラフに含まれる誘導木の列挙"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-06-06"},"_buckets":{"deposit":"ac7d24d8-0f3a-4e7a-bbfb-6c0ec8f0bc2b"},"_deposit":{"id":"101704","pid":{"type":"depid","value":"101704","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"K-縮退グラフに含まれる誘導木の列挙","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"K-縮退グラフに含まれる誘導木の列挙"},{"subitem_title":"Enumeration of Induced Subtrees in a K-Degenerate Graph","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2014-06-06","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":"Hokkaido University, Graduate School of Information Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University, Graduate School of Information Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","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/101704/files/IPSJ-AL14148017.pdf"},"date":[{"dateType":"Available","dateValue":"2016-06-06"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL14148017.pdf","filesize":[{"value":"694.8 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":"c1b80191-e9a0-4874-b14d-d2d0ec67e58c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"和佐, 州洋"},{"creatorName":"有村, 博紀"},{"creatorName":"宇野, 毅明"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kunihiro, Wasa","creatorNameLang":"en"},{"creatorName":"Hiroki, Arimura","creatorNameLang":"en"},{"creatorName":"Takeaki, Uno","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では，k- 縮退グラフに含まれる誘導木 （連結かつ非巡回な誘導部分グラフ） を，効率よく列挙するアルゴリズムを与える．グラフ G=(V，E) が k-縮退 （k-degenerate） であるとは，G の任意の部分グラフが高々 k の次数を持つ頂点を含むときをいう．これまで，制約のある誘導部分グラフの列挙に関しては，連結な誘導グラフ （Avis，Fukuda，DAM，1996） や，コードレスパス，コードレスサイクル （宇野，第 92 回アルゴリズム研究会，2003） の列挙に関する先行研究があるが，誘導木については知られていない．最大次数が d のとき，誘導木 1 つ当たり O(d) 遅延の列挙アルゴリズムは容易に構成できるが，これをどの程度まで改善できるかは未解決の問題である．我々のアルゴリズムは，入力グラフ G が k- 縮退グラフであるとき，誘導木を 1 つ当たりならし O(k) 時間で列挙する．系として，k が定数ならば，誘導木を 1 つたり，ならし定数時間で列挙可能である．","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":"2014-06-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"17","bibliographicVolumeNumber":"2014-AL-148"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:47:11.964120+00:00","id":101704,"links":{}}