{"updated":"2025-01-22T16:22:11.794412+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032010","sets":["1164:2592:2640:2641"]},"path":["2641"],"owner":"1","recid":"32010","title":["正則２部グラフに対する単純なマッチングアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-11-27"},"_buckets":{"deposit":"015e1e0f-ac7d-4410-ba9f-730b641e9a0a"},"_deposit":{"id":"32010","pid":{"type":"depid","value":"32010","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"正則２部グラフに対する単純なマッチングアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"正則２部グラフに対する単純なマッチングアルゴリズム"},{"subitem_title":"A Simple Matching Algorithm for Regular Bipartite Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-11-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院基礎工学研究科システム科学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科システム科学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科システム科学分野"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Division of  Systems Science, Graduate School of Engineering Science, Osaka University,","subitem_text_language":"en"},{"subitem_text_value":"Division of  Systems Science, Graduate School of Engineering Science, Osaka University,","subitem_text_language":"en"},{"subitem_text_value":"Division of  Systems Science, Graduate School of Engineering Science, Osaka University,","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/32010/files/IPSJ-AL01081004.pdf"},"date":[{"dateType":"Available","dateValue":"2003-11-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01081004.pdf","filesize":[{"value":"104.3 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":"5dfc44b3-d820-4123-9d60-221e2245a960","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"牧野, 和久"},{"creatorName":"高畑, 貴志"},{"creatorName":"藤重, 悟"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuhisa, Makino","creatorNameLang":"en"},{"creatorName":"Takashi, Takabatake","creatorNameLang":"en"},{"creatorName":"Satoru, Fujishige","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":"本論文では，△-正則２ 部グラフに対する完全マッチング問題を考察する．ただし，グラフG は，n 節点，m 枝，すなわち，1/2 n △=m とする．我々は，まず，Gabow の方法に基づく新しい単純なO(m log n )アルゴリズムを与える．次に，Cole とHopcroft が提案した正則２ 部グラフに対する辺疎化手法を取り入れることにより，そのアルゴリズムをO(m +n log n log △)に改善する．我々のアルゴリズムは，動的木やスプレイ木などの高度なデータ構造を必要としない．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider the perfect matching problem for a △-regular bipartite graph with n vertices and m edges,i.e.,1/2n△=m .We first give a new simple O(m log n )algorithm based on Gabow ’s approach, and then improve it to a faster O(m+n log n log △)algorithm by incorporating Cole and Hopcroft's edge-sparsification for regular bipartite graphs. Our algorithms employ no sophisticated data structure such as dynamic tree and splay tree.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"34","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"27","bibliographicIssueDates":{"bibliographicIssueDate":"2001-11-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"115(2001-AL-081)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:12.311886+00:00","id":32010,"links":{}}