{"_buckets": {"deposit": "a0954b71-fb18-41b9-b280-9c513c1b4c9c"}, "_deposit": {"created_by": 29, "id": "16225", "owners": [29], "pid": {"revision_id": 0, "type": "depid", "value": "16225"}, "status": "published"}, "_oai": {"id": "oai:ir.kagoshima-u.ac.jp:00016225", "sets": ["5070", "53"]}, "author_link": ["141213", "141212", "141217", "141216", "141215", "141214"], "item_7_alternative_title_19": {"attribute_name": "タイトルよみ", "attribute_value_mlt": [{"subitem_alternative_title": "サイダイ フロー モンダイ ニオケル ゼンサイショウ カット トクテイ ノ イチホウホウ"}]}, "item_7_biblio_info_5": {"attribute_name": "収録雑誌名", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2016-12-30", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "9", "bibliographicPageStart": "1", "bibliographicVolumeNumber": "49", "bibliographic_titles": [{"bibliographic_title": "鹿児島大学理学部紀要"}, {"bibliographic_title": "Reports of the Faculty of Science, Kagoshima University", "bibliographic_titleLang": "en"}]}]}, "item_7_description_4": {"attribute_name": "要約(Abstract)", "attribute_value_mlt": [{"subitem_description": "In this paper, it is a purpose to identify all Minimum-cuts using the solution method of Maximum-flow problem of the graph theory. Several methods and algorithms to search for the Minimum-cut has been contrived by itself already. Based on these results, we checked a relation between the edges and minimum cuts in detail, and propose about the method to specify all Minimum-cuts which aimed at the increased operation when solving the biggest flow problem. We can get the edges included in the Minimum-cut, the pair of edges which become the Minimum-cut efficiently by using this method.", "subitem_description_type": "Other"}]}, "item_7_full_name_2": {"attribute_name": "著者よみ", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "141214", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "シンモリ, シュウイチ"}]}, {"nameIdentifiers": [{"nameIdentifier": "141215", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "ニシダ, ヨシヒロ"}]}]}, "item_7_full_name_3": {"attribute_name": "別言語の著者", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "141216", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "SHINMORI, Shuichi"}]}, {"nameIdentifiers": [{"nameIdentifier": "141217", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "NISHIDA, Yoshihiro"}]}]}, "item_7_publisher_23": {"attribute_name": "公開者・出版者", "attribute_value_mlt": [{"subitem_publisher": "鹿児島大学"}]}, "item_7_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "13456938", "subitem_source_identifier_type": "ISSN"}]}, "item_7_source_id_9": {"attribute_name": "NII書誌ID", "attribute_value_mlt": [{"subitem_source_identifier": "AA11246904", "subitem_source_identifier_type": "NCID"}]}, "item_7_subject_15": {"attribute_name": "NDC", "attribute_value_mlt": [{"subitem_subject": "410", "subitem_subject_scheme": "NDC"}]}, "item_7_text_24": {"attribute_name": "公開者よみ", "attribute_value_mlt": [{"subitem_text_value": "カゴシマ ダイガク"}]}, "item_7_text_25": {"attribute_name": "公開者別名", "attribute_value_mlt": [{"subitem_text_value": "Kagoshima University"}]}, "item_7_version_type_14": {"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": "141212", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "西田, 美博"}], "nameIdentifiers": [{"nameIdentifier": "141213", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2022-09-12"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "AA11246904_v49_p1-9.pdf", "filesize": [{"value": "723.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 723900.0, "url": {"label": "AA11246904_v49_p1-9", "url": "https://ir.kagoshima-u.ac.jp/record/16225/files/AA11246904_v49_p1-9.pdf"}, "version_id": "5e365ea2-18e4-476f-8416-0402a44085ac"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Maximum-flow problem", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Minimum-cut", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Graph theory", "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": "An Identification Method of All Minimum-Cuts in the Maximum-Flow Problem", "subitem_title_language": "en"}]}, "item_type_id": "7", "owner": "29", "path": ["53", "5070"], "permalink_uri": "http://hdl.handle.net/10232/00032111", "pubdate": {"attribute_name": "公開日", "attribute_value": "2022-09-12"}, "publish_date": "2022-09-12", "publish_status": "0", "recid": "16225", "relation": {}, "relation_version_is_last": true, "title": ["最大フロー問題における全最小カット特定の一方法"], "weko_shared_id": -1}