{"created":"2023-05-15T15:28:04.405239+00:00","id":56,"links":{},"metadata":{"_buckets":{"deposit":"9f88539e-386b-4777-b1b2-f937390e84de"},"_deposit":{"created_by":3,"id":"56","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"56"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00000056","sets":[]},"author_link":["296","294","295"],"item_1_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2000-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"77","bibliographicPageStart":"35","bibliographicVolumeNumber":"4","bibliographic_titles":[{"bibliographic_title":"Journal of Combinatorial Optimization"}]}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Kluwer Academic Publishers"}]},"item_1_relation_8":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"info:doi/10.1023/A:1009884922499","subitem_relation_type_select":"DOI"}}]},"item_1_rights_12":{"attribute_name":"権利表記","attribute_value_mlt":[{"subitem_rights":"The original publication is available at www.springerlink.com"}]},"item_1_rights_13":{"attribute_name":"出版社版URI","attribute_value_mlt":[{"subitem_rights":"http://www.springerlink.com/content/1382-6905/"}]},"item_1_source_id_11":{"attribute_name":"書誌ID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AA11120156","subitem_source_identifier_type":"NCID"}]},"item_1_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"1382-6905","subitem_source_identifier_type":"ISSN"}]},"item_1_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"007","subitem_subject_scheme":"NDC"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"情報学","subitem_subject_scheme":"Other"}]},"item_1_version_type_15":{"attribute_name":"テキストバージョン","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ishii, Toshimasa"}],"nameIdentifiers":[{"nameIdentifier":"294","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Nagamochi, Hiroshi"}],"nameIdentifiers":[{"nameIdentifier":"295","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Ibaraki, Toshihide"}],"nameIdentifiers":[{"nameIdentifier":"296","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-22"}],"displaytype":"detail","filename":"j_combinatorial_optimization4(1).pdf","filesize":[{"value":"565.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"j_combinatorial_optimization4(1).pdf","url":"https://barrel.repo.nii.ac.jp/record/56/files/j_combinatorial_optimization4(1).pdf"},"version_id":"9f154770-5cc9-4c2c-827a-578d8bc08d7a"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"undirected multigraph","subitem_subject_scheme":"Other"},{"subitem_subject":"edge-connectivity","subitem_subject_scheme":"Other"},{"subitem_subject":"vertex-connectivity","subitem_subject_scheme":"Other"},{"subitem_subject":"graph augmentation","subitem_subject_scheme":"Other"},{"subitem_subject":"polynomial deterministic algorithm","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph"}]},"item_type_id":"1","owner":"3","path":["4"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-11-30"},"publish_date":"2007-11-30","publish_status":"0","recid":"56","relation_version_is_last":true,"title":["Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-20T07:43:10.225175+00:00"}