{"created":"2023-05-15T15:28:04.277633+00:00","id":54,"links":{},"metadata":{"_buckets":{"deposit":"02ca4d61-dcf6-4310-a0c6-b46d71d7a3b6"},"_deposit":{"created_by":17,"id":"54","owners":[17],"pid":{"revision_id":0,"type":"depid","value":"54"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00000054","sets":["4"]},"author_link":["289","290","291"],"item_1_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2006-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageEnd":"280","bibliographicPageStart":"257","bibliographicVolumeNumber":"44","bibliographic_titles":[{"bibliographic_title":"Algorithmica","bibliographic_titleLang":"en"}]}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Springer-Verlag","subitem_publisher_language":"en"}]},"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.1007/s00453-005-1151-4","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","subitem_rights_language":"en"}]},"item_1_rights_13":{"attribute_name":"出版社版URI","attribute_value_mlt":[{"subitem_rights":"http://www.springerlink.com/content/0178-4617/","subitem_rights_language":"ja"}]},"item_1_source_id_11":{"attribute_name":"書誌ID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AA10679010","subitem_source_identifier_type":"NCID"}]},"item_1_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"0178-4617","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"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"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":"289","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Nagamochi, Hiroshi","creatorNameLang":"en","creatorNameType":"Personal"}],"nameIdentifiers":[{"nameIdentifier":"290","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Ibaraki, Toshihide","creatorNameLang":"en","creatorNameType":"Personal"}],"nameIdentifiers":[{"nameIdentifier":"291","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":"algo_44(3).pdf","filesize":[{"value":"314.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"algo_44(3).pdf","url":"https://barrel.repo.nii.ac.jp/record/54/files/algo_44(3).pdf"},"version_id":"c847dc9b-b221-4d57-a751-1f5fdf8bd4ab"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Undirected multigraph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Edge-connectivity","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Vertex-connectivity","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Graph augmentation","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Polynomial time approximation algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Deterministic algorithm","subitem_subject_language":"en","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":"Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph","subitem_title_language":"en"}]},"item_type_id":"1","owner":"17","path":["4"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2007-11-28"},"publish_date":"2007-11-28","publish_status":"0","recid":"54","relation_version_is_last":true,"title":["Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph"],"weko_creator_id":"17","weko_shared_id":-1},"updated":"2025-03-17T00:27:24.470541+00:00"}