{"created":"2023-05-15T12:31:09.281646+00:00","id":714,"links":{},"metadata":{"_buckets":{"deposit":"48e668da-a636-4cbe-9a5e-e37967b10f49"},"_deposit":{"created_by":6,"id":"714","owners":[6],"pid":{"revision_id":0,"type":"depid","value":"714"},"status":"published"},"_oai":{"id":"oai:fit.repo.nii.ac.jp:00000714","sets":["256:257:373"]},"author_link":["3323","3322","3321"],"item_3_alternative_title_23":{"attribute_name":"タイトル（ヨミ）","attribute_value_mlt":[{"subitem_alternative_title":"テン ブブン シュウゴウ ニ カンスル カクダイ コウセイ モンダイ"}]},"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1995-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"152","bibliographicPageStart":"139","bibliographicVolumeNumber":"27","bibliographic_titles":[{"bibliographic_title":"福岡工業大学研究論集"},{"bibliographic_title":"RESEARCH BULLETIN OF FUKUOKA INSTITUTE OF TECHNOLOGY","bibliographic_titleLang":"en"}]}]},"item_3_description_17":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_3_description_47":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"論文(Article)","subitem_description_type":"Other"}]},"item_3_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"A (directed) graph G=(V, E) is k-edge-connected with respect to a vertex-set V'c V if and only if there are k edge-disjoint u-v paths for any two vertices u, v E V'(there are k edge­disjoint directed paths from u to v and k edge-disjoint directed paths from v to u respectively, for directed version). The k-edge-connected augmentation problem for a specified vertex-set is: Given a (directed) graph C。=（V₀，E₀)， find a smallest (directed) edge-set A such that C'= (V₀, E₀ U A) is k-edge-connected with respect to some vertex-set V c V₀. In this paper, I will propose the following results: The strong connected augmentation problem for a specified vertex-set is NP-complete, and an algorithm for solving the k-edge-connected one for a specified vertex-set with k=2, 3 cases. ","subitem_description_type":"Other"}]},"item_3_full_name_2":{"attribute_name":"著者(ヨミ)","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"3322","nameIdentifierScheme":"WEKO"}],"names":[{"name":"タカハシ, マサヤ"}]}]},"item_3_full_name_3":{"attribute_name":"別言語の著者","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"3323","nameIdentifierScheme":"WEKO"}],"names":[{"name":"TAKAHASHI, Masaya"}]}]},"item_3_publisher_37":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"福岡工業大学"}]},"item_3_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"02876620","subitem_source_identifier_type":"ISSN"}]},"item_3_text_38":{"attribute_name":"出版者（ヨミ）","attribute_value_mlt":[{"subitem_text_value":"フクオカ コウギョウ ダイガク"}]},"item_3_text_39":{"attribute_name":"別言語の出版者","attribute_value_mlt":[{"subitem_text_value":"Fukuoka Institute of Technology"}]},"item_3_text_48":{"attribute_name":"資源タイプ・ローカル","attribute_value_mlt":[{"subitem_text_value":"紀要論文"}]},"item_3_text_49":{"attribute_name":"資源タイプ・NII","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper"}]},"item_3_text_50":{"attribute_name":"資源タイプ・DCMI","attribute_value_mlt":[{"subitem_text_value":"text"}]},"item_3_text_51":{"attribute_name":"資源タイプ・ローカル表示コード","attribute_value_mlt":[{"subitem_text_value":"02"}]},"item_3_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高橋, 昌也"}],"nameIdentifiers":[{"nameIdentifier":"3321","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","displaytype":"detail","filename":"27(2)-139.pdf","filesize":[{"value":"982.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://fit.repo.nii.ac.jp/record/714/files/27(2)-139.pdf"},"version_id":"f5505425-c6d4-4a9e-9915-f6f57298e85b"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"2-edge-connected graph","subitem_subject_scheme":"Other"},{"subitem_subject":"3-edge-connected graph","subitem_subject_scheme":"Other"},{"subitem_subject":"strong connected digraph and 3-(2-) edge-component condensation for a specified vertex-set","subitem_subject_scheme":"Other"},{"subitem_subject_scheme":"Other"},{"subitem_subject":"2-edge-connected graph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"3-edge-connected graph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"strong connected digraph and 3-(2-) edge-component condensation for a specified vertex-set","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"点部分集合に関する拡大構成問題","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"点部分集合に関する拡大構成問題"},{"subitem_title":"Augmentation Problems for a Specified Vertex-Set","subitem_title_language":"en"}]},"item_type_id":"3","owner":"6","path":["373"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-02"},"publish_date":"2021-03-02","publish_status":"0","recid":"714","relation_version_is_last":true,"title":["点部分集合に関する拡大構成問題"],"weko_creator_id":"6","weko_shared_id":-1},"updated":"2023-05-15T14:01:45.967185+00:00"}