{"updated":"2025-01-22T16:13:07.135185+00:00","links":{},"id":32312,"created":"2025-01-18T23:01:25.915100+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032312","sets":["1164:2592:2679:2680"]},"path":["2680"],"owner":"1","recid":"32312","title":["3-連結グラフに対する点被覆及び連結点被覆問題について"],"pubdate":{"attribute_name":"公開日","attribute_value":"1995-11-17"},"_buckets":{"deposit":"31d8abe8-d621-45cf-86c2-bc6a066a0916"},"_deposit":{"id":"32312","pid":{"type":"depid","value":"32312","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"3-連結グラフに対する点被覆及び連結点被覆問題について","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"3-連結グラフに対する点被覆及び連結点被覆問題について"},{"subitem_title":"On the Complexity of Vertex Cover and Connected Vertex Cover Problems for 3 - Connected Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1995-11-17","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":"Department of Circuits and Systems, Faculty of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Department of Circuits and Systems, Faculty of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Department of Circuits and Systems, Faculty of Engineering, Hiroshima 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/32312/files/IPSJ-AL95048001.pdf"},"date":[{"dateType":"Available","dateValue":"1997-11-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL95048001.pdf","filesize":[{"value":"558.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":"6254fb6f-fb37-4b1b-8383-24d17956c6c9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1995 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":"Isao, Shibata","creatorNameLang":"en"},{"creatorName":"Toshihiro, Fujito","creatorNameLang":"en"},{"creatorName":"Toshimasa, Watanabe","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":"本論文では，3?連結グラフに対する点被覆及び連結点被覆問題について考える．但し，3?連結グラフの部分族である準車輪の族及び車輪拡大グラフの族に対象を制限して問題を考える．本稿では，まず車輪拡大グラフに対する点被覆問題がNP完全問題であることを示す．これと既存の結果とを合わせれば，車輪拡大グラフに対する連結点被覆問題もまたNP完全問題であることが示される．次に，準車輪グラフに対する連結点被覆問題を線形マトロイドマッチング問題に帰着させ，線形マトロイドマッチング問題の解法を利用することにより，準車輪グラフに対する最小連結点被覆がO（|V|^)で定められることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The subject of paper is the vertex cover problem (VCP) and the connected vertex cover problem (CVCP) for 3-connected graphs. More specifically, VCP and CVCP for the two classes of 3-connected graphs, called quasi-wheels and super-wheels, are considered. First we prove that VCP for super-wheels is NP-complete. This result, combined with the known result on the relationship between VCP and CVCP for super-wheels, implies that CVCP for super-wheels is NP-complete. By reducing CVCP for quasi-wheels to linear matroid matching problem, it is shown that a minimum connected vertex cover for any given quasi-wheel can be obtained in polynomial time.","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":"1995-11-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"109(1995-AL-048)","bibliographicVolumeNumber":"1995"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}