{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032182","sets":["1164:2592:2659:2663"]},"path":["2663"],"owner":"1","recid":"32182","title":["部分k木に対する辺素な道問題のNP-完全性"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-05-20"},"_buckets":{"deposit":"ec26d04b-d8e8-42ab-84b8-b8f10de28147"},"_deposit":{"id":"32182","pid":{"type":"depid","value":"32182","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"部分k木に対する辺素な道問題のNP-完全性","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"部分k木に対する辺素な道問題のNP-完全性"},{"subitem_title":"The Edge - Disjoint Paths Problem is NP - Complete for Partial k - Trees","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-05-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大学"},{"subitem_text_value":"東北大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences Tohoku 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/32182/files/IPSJ-AL98062004.pdf"},"date":[{"dateType":"Available","dateValue":"2000-05-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL98062004.pdf","filesize":[{"value":"644.2 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":"ae7de837-040a-42df-af44-7fe2dedfae60","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"周暁"},{"creatorName":"西関, 隆夫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Xiao, Zhou","creatorNameLang":"en"},{"creatorName":"Takao, Nishizeki","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":"数多くの組合せ問題は一般のグラフに対してNP?完全であるが，kが定数であるような部分k木に対しては多項式時間で，あるいはほとんどの場合線形時間で解ける．一方，いくつかの問題は部分k木に対してすらNP?完全である.しかしそのような問題は数少く わずかに部分グラフ同形問題と帯域幅（bandwidth）問題等が部分k木に対してNP?完全であることが知られているにすぎない．しかもこれらの問題はk＝1なる部分k木，すなわち通常の木あるいは林に対してすらNP?完全である．このようにk＝1なる部分k木に対しては多項式，時間で解け，2以上で定数の部分k木に対してはNP?完全であるような問題は知られていなかった．本論文は辺素な道問題がそのような一例であることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems on unweighted graphs are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem and the bandwidth problem. However, all these problems are NP-complete even for ordinary trees or forests, and there have been no known problems which are efficiently solvable for trees but NP-complete for partial k-trees. In this paper we present the first example of such problems, that is ,we show that the edge-disjoint paths problem is NP-complete for partial k-trees with some bounded k〓2 although the problem is trivially solvable for trees.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"1998-05-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"41(1998-AL-062)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32182,"updated":"2025-01-22T16:17:08.202079+00:00","links":{},"created":"2025-01-18T23:01:20.078033+00:00"}