{"updated":"2025-01-21T16:02:52.299027+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00090409","sets":["1164:2592:7086:7087"]},"path":["7087"],"owner":"11","recid":"90409","title":["順列二分決定グラフを用いたパターン回避順列の列挙索引化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-02-22"},"_buckets":{"deposit":"50b75add-a97e-4d3c-b54e-18ac9f9ee184"},"_deposit":{"id":"90409","pid":{"type":"depid","value":"90409","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"順列二分決定グラフを用いたパターン回避順列の列挙索引化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"順列二分決定グラフを用いたパターン回避順列の列挙索引化"},{"subitem_title":"Enumerating and Indexing of Pattern Avoiding Permutations Using πDDs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2013-02-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北海道大学情報科学研究科／JST ERATO 湊離散構造処理系プロジェクト"},{"subitem_text_value":"JST ERATO 湊離散構造処理系プロジェクト／北海道大学情報科学研究科"},{"subitem_text_value":"北海道大学情報科学研究科／JST ERATO 湊離散構造処理系プロジェクト"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University IST / JST ERATO Project","subitem_text_language":"en"},{"subitem_text_value":"JST ERATO Project / Hokkaido University IST","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University IST / JST ERATO Project","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/90409/files/IPSJ-AL13143005.pdf"},"date":[{"dateType":"Available","dateValue":"2015-02-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL13143005.pdf","filesize":[{"value":"1.4 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":"14c41d31-dc95-4c2b-95eb-2ea0baedf1f9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 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":"Yuma, Inoue","creatorNameLang":"en"},{"creatorName":"Takahisa, Toda","creatorNameLang":"en"},{"creatorName":"Shin-ichi, Minato","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":"パターン回避順列とは，任意の部分列が特定の順序関係を持たないような順列をいう．パターン回避順列は，VLSIの設計などの応用に現れるフロアプランとの対応が明らかになるなど，応用分野でも近年注目を集めている．本稿では，順列集合を効率的に扱うことができるπDDというデータ構造に基づき，パターン回避順列，およびその拡張である隣接条件付きパターン回避順列を列挙索引化するアルゴリズムを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Pattern avoiding permutation is a permutation whose subsequences don't match a certain order. Pattern avoiding permutation is discussed on not only theoretical areas but also application areas, for example, floorplan for compacting VLSI. In this paper, we provide the algorithms for enumerating and indexing of pattern avoiding permutations and vincular pattern avoiding permutations, which have a extend definition of pattern avoiding, based on the efficient data structure for the set of permutations, πDDs.","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":"2013-02-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2013-AL-143"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:39:59.712809+00:00","id":90409,"links":{}}