{"created":"2025-01-18T23:01:45.447070+00:00","updated":"2025-01-22T16:02:30.342532+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032738","sets":["1164:2592:2721:2729"]},"path":["2729"],"owner":"1","recid":"32738","title":["3-連結グラフの3分割アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-01-25"},"_buckets":{"deposit":"4962666c-add8-48c7-b9b7-31c9376cb9a0"},"_deposit":{"id":"32738","pid":{"type":"depid","value":"32738","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"3-連結グラフの3分割アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"3-連結グラフの3分割アルゴリズム"},{"subitem_title":"An Algorithm for Tripartitioning 3 - Connected Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1989-01-25","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学"},{"subitem_text_value":"東北大学"},{"subitem_text_value":"東北大学"},{"subitem_text_value":"東北大学"},{"subitem_text_value":"東京工業大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/32738/files/IPSJ-AL88005011.pdf"},"date":[{"dateType":"Available","dateValue":"1991-01-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL88005011.pdf","filesize":[{"value":"861.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1b390d71-8e03-47b0-9b71-9fc814022798","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"上野, 修一"},{"creatorName":"鈴木, 均"},{"creatorName":"高橋, 奈穂美"},{"creatorName":"西関, 隆夫"},{"creatorName":"宮野, 浩"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shuichi, Ueno","creatorNameLang":"en"},{"creatorName":"Hitoshi, Suzuki","creatorNameLang":"en"},{"creatorName":"Naomi, Takahashi","creatorNameLang":"en"},{"creatorName":"Takao, Nishizeki","creatorNameLang":"en"},{"creatorName":"Hiroshi, Miyano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本報告では，与えられた3‐連結グラフを，指定した点を含みかつ指定した大きさの3つの連結部分グラフに分割するO(n^2)時間のアルゴリズムを与える．ここでnはグラフの点数である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this report, we present an algorithm for partitioning a 3-connected graph G into three connected subgraphs each containing a specified vertex and having a specified size. The algorithm runs in O(n^2) time, where n is the number of vertices in G.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"85","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"79","bibliographicIssueDates":{"bibliographicIssueDate":"1989-01-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8(1988-AL-005)","bibliographicVolumeNumber":"1989"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32738,"links":{}}