{"id":124002,"updated":"2025-01-21T02:43:37.348841+00:00","links":{},"created":"2025-01-19T00:03:59.789102+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00124002","sets":["6504:8043:8045"]},"path":["8045"],"owner":"1","recid":"124002","title":["節点集合の移動に基づくグラフ分割手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-09-27"},"_buckets":{"deposit":"9a3ffa96-84e7-409e-8839-1021cee7f009"},"_deposit":{"id":"124002","pid":{"type":"depid","value":"124002","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"節点集合の移動に基づくグラフ分割手法","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"節点集合の移動に基づくグラフ分割手法"},{"subitem_title":"A graph bisection algorithm based on subgraph migration","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1993-09-27","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"広島大学工学部"},{"subitem_text_value":"マツダ株式会社"},{"subitem_text_value":"広島大学工学部"},{"subitem_text_value":"広島大学工学部"},{"subitem_text_value":"広島大学工学部"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Technical Research Center, MAZDA Motor Corporation","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Hiroshima University","subitem_text_language":"en"}]},"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/124002/files/KJ00001338682.pdf"},"date":[{"dateType":"Available","dateValue":"1993-09-27"}],"format":"application/pdf","filename":"KJ00001338682.pdf","filesize":[{"value":"151.1 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"66f4ee7f-c065-4f30-be74-78e4d8fef8b4","displaytype":"detail","licensetype":"license_note"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿ではVLSlレイアウト設計における配置設計や分散処理におけるタスク割り当て等において重要な問題の1つであるグラフの分割問題について考察する.この問題に対する従来法としてはFM法,KL法等が知られているが,これらの手法は1個の節点の移動,交換に基づいているため局所解に陥りやすいという問題点がある.最近では,節点を集合単位で移動するアルゴリスムが幾つか提案されている.そこで本稿では,グラフの節点部分集合の移動に基づくヒューリスティックアルゴリズムを提案し,その実験的評価を行う.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"82","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"81","bibliographicIssueDates":{"bibliographicIssueDate":"1993-09-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"基礎理論及び基礎技術","bibliographicVolumeNumber":"第47回"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}