{"created":"2023-05-15T15:30:02.335396+00:00","id":2496,"links":{},"metadata":{"_buckets":{"deposit":"60239ed4-6bb3-4181-824d-4fa5e50fb5f2"},"_deposit":{"created_by":17,"id":"2496","owners":[17],"pid":{"revision_id":0,"type":"depid","value":"2496"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00002496","sets":["4"]},"author_link":["5345"],"item_1_biblio_info_5":{"attribute_name":"bibliographic_information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"36","bibliographicPageStart":"23","bibliographicVolumeNumber":"6","bibliographic_titles":[{"bibliographic_title":"Discrete Optimization","bibliographic_titleLang":"en"}]}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Elsevier","subitem_publisher_language":"en"}]},"item_1_relation_8":{"attribute_name":"item_1_relation_8","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"info:doi/10.1016/j.disopt.2008.08.002","subitem_relation_type_select":"DOI"}}]},"item_1_rights_13":{"attribute_name":"出版社版URI","attribute_value_mlt":[{"subitem_rights":"http://www.sciencedirect.com/science/article/pii/S1572528608000613","subitem_rights_language":"ja"}]},"item_1_source_id_11":{"attribute_name":"item_1_source_id_11","attribute_value_mlt":[{"subitem_source_identifier":"AA12016193","subitem_source_identifier_type":"NCID"}]},"item_1_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"1572-5286","subitem_source_identifier_type":"PISSN"}]},"item_1_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"007","subitem_subject_language":"ja","subitem_subject_scheme":"NDC"},{"subitem_subject":"415","subitem_subject_language":"ja","subitem_subject_scheme":"NDC"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"情報学","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"数学","subitem_subject_language":"ja","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","creatorNameLang":"en","creatorNameType":"Personal"}],"nameIdentifiers":[{"nameIdentifier":"5345","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-23"}],"displaytype":"detail","filename":"Ishii_DO09.pdf","filesize":[{"value":"307.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"Ishii_DO09.pdf","url":"https://barrel.repo.nii.ac.jp/record/2496/files/Ishii_DO09.pdf"},"version_id":"05130b3b-0f58-4efc-be93-5ad40f92cdb8"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"undirected graph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"connectivity augmentation problem","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"monotone requirement","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"polynomial time deterministic algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"item_resource_type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.","subitem_title_language":"en"}]},"item_type_id":"1","owner":"17","path":["4"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2009-07-21"},"publish_date":"2009-07-21","publish_status":"0","recid":"2496","relation_version_is_last":true,"title":["Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs."],"weko_creator_id":"17","weko_shared_id":-1},"updated":"2025-03-17T00:30:39.666870+00:00"}