{"created":"2025-01-19T01:11:32.337665+00:00","updated":"2025-01-19T18:12:14.496017+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00210284","sets":["1164:2592:10486:10558"]},"path":["10558"],"owner":"44499","recid":"210284","title":["順列グラフのカラフル独立集合問題に対するアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-10"},"_buckets":{"deposit":"52dbab3a-09b8-4f6b-921e-ebc0108e144b"},"_deposit":{"id":"210284","pid":{"type":"depid","value":"210284","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"順列グラフのカラフル独立集合問題に対するアルゴリズム","author_link":["531891","531890","531889"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"順列グラフのカラフル独立集合問題に対するアルゴリズム"}]},"item_type_id":"4","publish_date":"2021-03-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/210284/files/IPSJ-AL21182003.pdf","label":"IPSJ-AL21182003.pdf"},"date":[{"dateType":"Available","dateValue":"2023-03-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL21182003.pdf","filesize":[{"value":"778.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":"08efbfb1-a19a-49bc-9757-e35662b0556f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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_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":"グラフのカラフル独立集合問題は，頂点に色がついたグラフが与えられ，頂点集合の部分集合で独立かつカラフル，つまり部分集合内の任意の頂点が互いに隣接せずかつ色が相異なるもので最大の要素数のものを見つける問題である．この問題は，通常の最大独立集合問題の一般化であり，与えられたグラフが特定のグラフクラスに属する場合でも興味深い分析が行われている．本研究では，与えられたグラフが順列グラフの場合を考え，この問題の固定パラメータアルゴリズムや指数時間厳密アルゴリズムを議論する．","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":"2021-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2021-AL-182"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":210284,"links":{}}